Tilings and quasiperiodicity.

DOI10.1016/S0304-3975(99)00027-4zbMath1062.05502MaRDI QIDQ1960519

Bruno Durand

Publication date: 12 January 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

combinatoricsquasiperiodicitytilings2D words

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Related Items

Tilings: recursivity and regularity, Hierarchical self assembly of patterns from the Robinson tilings: DNA tile design in an enhanced tile assembly model, Algebraic and model-theoretic properties of tilings, Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines, Aperiodic points in $\mathbb Z^2$-subshifts, Quasiperiodicity and Non-computability in Tilings, Turing degrees of multidimensional SFTs, A Topological Study of Tilings, Complex tilings, On the behavior of growth of polygons in semi-regular hyperbolic tessellations, Tilings: simulation and universality, Strong cocycle triviality for \(Z^{2}\) subshifts, The expressiveness of quasiperiodic and minimal shifts of finite type, Quasiperiodic bobbin lace patterns, On the Expressive Power of Quasiperiodic SFT., Sandpile toppling on Penrose tilings: identity and isotropic dynamics, From logic to tiling

Cites Work

• Automata on infinite words. Ecole de Printemps d'Informatique Théorique, Le Mont Dore, May 14-18, 1984
• An aperiodic set of 13 Wang tiles
• A small aperiodic set of Wang tiles
• Sturmian words: structure, combinatorics, and their arithmetics
• The countability of a tiling family and the periodicity of a tiling
• Undecidability and nonperiodicity for tilings of the plane
• Ensembles Reconnaissables de Mots Biinfinis
• Descriptions of the Characteristic Sequence of an Irrational
• The undecidability of the domino problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item