Bounds on Non-surjective Cellular Automata

DOI10.1007/978-3-642-03816-7_38MaRDI QIDQ3182945zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jarkko Kari, Pascal Vanier, Thomas Zeume

Publication date 16 October 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-03816-7_38

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• Linear algebra based bounds for one-dimensional cellular automata
• scientific article; zbMATH DE number 1043977
• Realization problems for nonuniform cellular automata
• Non-uniform cellular automata: classes, dynamics, and decidability
• Non-uniform Cellular Automata

Cites work

• Automata, Languages and Programming
• Endomorphisms and automorphisms of the shift dynamical system
• scientific article; zbMATH DE number 3205673 (Why is no real title available?)
• Reversibility and surjectivity problems of cellular automata
• Set of periods of additive cellular automata
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
• Synchronizing finite automata on Eulerian digraphs.
• When-and how-can a cellular automaton be rewritten as a lattice gas?

Cited in

(5)

• Surjective multidimensional cellular automata are non-wandering: a combinatorial proof
• Towards a Rice Theorem on Traces of Cellular Automata
• On Nilpotency and Asymptotic Nilpotency of Cellular Automata
• Linear algebra based bounds for one-dimensional cellular automata
• Automata, Languages and Programming

This page was built for publication: Bounds on Non-surjective Cellular Automata

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