A comparison of finite and cellular automata

DOI10.1007/3-540-58338-6_95zbMATH Open1493.68190OpenAlexW1562895111MaRDI QIDQ5096907FDOQ5096907

Authors: 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

Recommendations

• scientific article; zbMATH DE number 4215382
• Formal languages and global cellular automaton behavior
• Computation theory of cellular automata
• scientific article; zbMATH DE number 17562
• Computational complexity of dynamical systems: the case of cellular automata

Mathematics Subject Classification ID

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

Cites Work

• Subshifts of finite type and sofic systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Simple Computation-Universal Cellular Spaces
• Computation theoretic aspects of cellular automata
• Unpredictability and undecidability in dynamical systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Regular unimodal systems and factors of finite automata

Cited In (4)

• Regular unimodal systems and factors of finite automata
• Complexity and universality of iterated finite automata
• On topological dynamics of Turing machines
• Two-dimensional languages and cellular automata

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

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