A comparison of finite and cellular automata

DOI10.1007/3-540-58338-6_95zbMath1493.68190OpenAlexW1562895111MaRDI QIDQ5096907

Petr Kůrka

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_95

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Related Items (1)

On topological dynamics of Turing machines

Cites Work

• Computation theoretic aspects of cellular automata
• Regular unimodal systems and factors of finite automata
• Subshifts of finite type and sofic systems
• Unpredictability and undecidability in dynamical systems
• Simple Computation-Universal Cellular Spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A comparison of finite and cellular automata