Abstract: A finite collection of finite sets tiles the integers iff the integers can be expressed as a disjoint union of translates of members of . We associate with such a tiling a doubly infinite sequence with entries from . The set of all such sequences is a sofic system, called a tiling system. We show that, up to powers of the shift, every shift of finite type can be realized as a tiling system.
Recommendations
Cites work
Cited in
(13)- An order on sets of tilings corresponding to an order on languages
- 2-adic behavior of numbers of domino tilings
- scientific article; zbMATH DE number 2050951 (Why is no real title available?)
- Finitely balanced sequences and plasticity of 1-dimensional tilings
- scientific article; zbMATH DE number 2158946 (Why is no real title available?)
- Subshifts of finite type which have completely positive entropy
- Decimation and interleaving operations in one-sided symbolic dynamics
- Entropy along convex shapes, random tilings and shifts of finite type
- Translational tilings of the integers with long periods
- A Glimpse into Thurston’s Work
- The symbolic dynamics of multidimensional tiling systems
- scientific article; zbMATH DE number 1101448 (Why is no real title available?)
- scientific article; zbMATH DE number 4094278 (Why is no real title available?)
This page was built for publication: The symbolic dynamics of tiling the integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q696277)