15-453 Formal Languages, Automata, and Computation
Lecture 24: Tiling

We consider a language as a predicate on strings and investigate the closure properties of decidable and recognizable languages under various logical operations. Then we consider a new problem: Given a set of square tiles of identical size with labeled edges, cover the whole (infinite) plane with tiles such that all touching edges match.