The Injectivity of the Global Function of a Cellular Automaton in the Hyperbolic Plane is Undecidable

DOI10.3233/FI-2009-118zbMATH Open1191.68421OpenAlexW1624687270WikidataQ121826523 ScholiaQ121826523MaRDI QIDQ3397158FDOQ3397158

Authors: M. Margenstern 

Publication date: 22 September 2009

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2009-118

Recommendations

• scientific article; zbMATH DE number 7298593
• Towards the frontier between decidability and undecidability for hyperbolic cellular automata
• scientific article; zbMATH DE number 4197448
• Reversibility and surjectivity problems of cellular automata
• THE FINITE TILING PROBLEM IS UNDECIDABLE IN THE HYPERBOLIC PLANE

zbMATH Keywords

cellular automatahyperbolic planetessellations

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cited In (3)

• Cellular automata between sofic tree shifts
• Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results
• Title not available (Why is that?)

This page was built for publication: The Injectivity of the Global Function of a Cellular Automaton in the Hyperbolic Plane is Undecidable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3397158)