Tilings: recursivity and regularity

DOI10.1016/S0304-3975(03)00242-1zbMath1071.68078MaRDI QIDQ1884987

Bruno Durand, Julien Cervelle

Publication date: 27 October 2004

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

zbMATH Keywords

TilingsQuasiperiodicityRecursivity

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Undecidability and degrees of sets of sentences (03D35) Cellular automata (computational aspects) (68Q80) Combinatorial aspects of tessellation and tiling problems (05B45) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (4)

Grid topologies for the self-organizing map ⋮ A Topological Study of Tilings ⋮ Tilings: simulation and universality ⋮ Sandpile toppling on Penrose tilings: identity and isotropic dynamics

Cites Work

• A Random NP-complete problem for inversion of 2D cellular automata
• Average case completeness
• Reversibility and surjectivity problems of cellular automata
• Inversion of 2D cellular automata: Some complexity results
• The surjectivity problem for 2D cellular automata
• Tilings and quasiperiodicity.
• Simulations between cellular automata on Cayley graphs
• Undecidability and nonperiodicity for tilings of the plane
• Average Case Complete Problems
• Tilings and quasiperiodicity
• The undecidability of the domino problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tilings: recursivity and regularity