Cellular automata, tilings and (un)computability

DOI10.1017/CBO9781139924733.009MaRDI QIDQ5365564zbMATH OpenOpenAlexFDO

Authors Jarkko Kari

Publication date 6 October 2017

Published in Combinatorics, Words and Symbolic Dynamics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/cbo9781139924733.013

zbMATH Keywords

cellular automatareversibilitytiling problem

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80)

Recommendations

• Decidability and undecidability in cellular automata
• Snakes and cellular automata: reductions and inseparability results
• scientific article; zbMATH DE number 522847
• Reversibility and surjectivity problems of cellular automata
• Publication:3468913
• Theory of cellular automata: a survey
• The Nilpotency Problem of One-Dimensional Cellular Automata
• Computational classification of cellular automata

Cited in

(8)

• An automaton group with undecidable order and Engel problems
• Filling curves constructed in cellular automata with aperiodic tiling
• The work of Mike Hochman on multidimensional symbolic dynamics and Borel dynamics
• Snakes and cellular automata: reductions and inseparability results
• Cellular automata on irregular tessellations
• scientific article; zbMATH DE number 7357524 (Why is no real title available?)
• Self-stabilisation of Cellular Automata on Tilings
• Polyomino tilings, cellular automata and codicity

This page was built for publication: Cellular automata, tilings and (un)computability

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