Bounds on Non-surjective Cellular Automata

DOI10.1007/978-3-642-03816-7_38zbMath1250.68205OpenAlexW1607139407WikidataQ62045935 ScholiaQ62045935MaRDI QIDQ3182945

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)

Related Items (1)

Linear Algebra Based Bounds for One-Dimensional Cellular Automata

Cites Work

• Unnamed Item
• Set of periods of additive cellular automata
• Reversibility and surjectivity problems of cellular automata
• Synchronizing finite automata on Eulerian digraphs.
• When-and how-can a cellular automaton be rewritten as a lattice gas?
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
• Endomorphisms and automorphisms of the shift dynamical system
• Automata, Languages and Programming

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