Linear algebra based bounds for one-dimensional cellular automata

DOI10.1007/978-3-642-22600-7_1MaRDI QIDQ5200076zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jarkko Kari

Publication date 29 July 2011

Published in Descriptional Complexity of Formal Systems (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• Bounds on Non-surjective Cellular Automata
• On the size of the inverse neighborhoods for one-dimensional reversible cellular automata
• scientific article; zbMATH DE number 176951
• On reversibility of cellular automata with periodic boundary conditions
• Automata, Languages and Programming

Cites work

• Automata, Languages and Programming
• Bounds on Non-surjective Cellular Automata
• Endomorphisms and automorphisms of the shift dynamical system
• scientific article; zbMATH DE number 21231 (Why is no real title available?)
• scientific article; zbMATH DE number 3205673 (Why is no real title available?)
• Reversibility and surjectivity problems of cellular automata
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
• Theory of cellular automata: a survey

Cited in

(4)

• A variational formula for dimension spectra of linear cellular automata
• Line complexity asymptotics of polynomial cellular automata
• Bounds on Non-surjective Cellular Automata
• Automata, Languages and Programming

This page was built for publication: Linear algebra based bounds for one-dimensional cellular automata

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