Shrinking One-Way Cellular Automata

DOI10.1007/978-3-662-47221-7_11MaRDI QIDQ5500619zbMATH OpenOpenAlexFDO

Authors Martin Kutrib, Andreas Malcher, Matthias Wendlandt

Publication date 7 August 2015

Published in Cellular Automata and Discrete Complex Systems (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-01442469/file/338243_1_En_11_Chapter.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Recommendations

• Shrinking and expanding cellular automata
• The size of one-way cellular automata
• scientific article; zbMATH DE number 2113947
• Deterministic one-dimensional cellular automata
• Computations on one-dimensional cellular automata
• Complexity of one-way cellular automata
• Expansive invertible onesided cellular automata
• One-dimensional stochastic cellular automata
• Partial reversibility of one-dimensional cellular automata
• One-dimensional cellular automata as arithmetic recursions

Cited in

(7)

• Fast language acceptance by shrinking cellular automata
• Lower bounds and hardness magnification for sublinear-time shrinking cellular automata
• Complexity-theoretic aspects of expanding cellular automata
• Shrinking and expanding cellular automata
• scientific article; zbMATH DE number 2113947 (Why is no real title available?)
• Shrinking one-way cellular automata
• Complexity-theoretic aspects of expanding cellular automata

This page was built for publication: Shrinking One-Way Cellular Automata

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