A Characterization of Cellular Automata Generated by Idempotents on the Full Shift

DOI10.1007/978-3-642-30642-6_27zbMath1360.68618arXiv1206.0585OpenAlexW103467267MaRDI QIDQ2907509

Jarkko Peltomäki

Publication date: 10 September 2012

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.0585

Mathematics Subject Classification ID

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

Related Items (2)

Category theory of symbolic dynamics ⋮ Decidability and undecidability in cellular automata

Cites Work

• Unnamed Item
• Theory of cellular automata: a survey
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• Lower entropy factors of sofic systems
• The Automorphism Group of a Shift of Finite Type
• The Nilpotency Problem of One-Dimensional Cellular Automata
• The topological entropy of cellular automata is uncomputable
• On the sofic limit sets of cellular automata
• An Introduction to Symbolic Dynamics and Coding
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem

This page was built for publication: A Characterization of Cellular Automata Generated by Idempotents on the Full Shift