About the Garden of Eden Theorems for Cellular Automata in the Hyperbolic Plane

DOI10.1016/j.entcs.2009.09.016zbMath1338.68185OpenAlexW2086704500WikidataQ56474286 ScholiaQ56474286MaRDI QIDQ2811952

Maurice Margenstern

Publication date: 9 June 2016

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.09.016

zbMATH Keywords

cellular automatahyperbolic planeglobal function of transition

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Elementary problems in hyperbolic and elliptic geometries (51M09)

Related Items

A survey of cellular automata: types, dynamics, non-uniformity and applications

Cites Work

• The domino problem of the hyperbolic plane is undecidable
• Amenable groups and cellular automata
• Reversibility and surjectivity problems of cellular automata
• ON A CHARACTERIZATION OF CELLULAR AUTOMATA IN TILINGS OF THE HYPERBOLIC PLANE
• The Tiling Problem Revisited (Extended Abstract)
• A Universal Cellular Automaton on the Ternary Heptagrid
• Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
• NP problems are tractable in the space of cellular automata in the hyperbolic plane
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item