Complexity of evolution languages of the elementary cellular automaton of rule 146

DOI10.1007/s11766-006-0006-3zbMath1204.68126OpenAlexW2080442886MaRDI QIDQ621874

Yi Wang, Kenichi Morita

Publication date: 29 January 2011

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-006-0006-3

zbMATH Keywords

complexitycellular automatonformal languageevolution language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Cellular automata (computational aspects) (68Q80)

Related Items (1)

Inferring the Limit Behavior of Some Elementary Cellular Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Aperiodicity in one-dimensional cellular automata
• Topological and measure-theoretic properties of one-dimensional cellular automata
• Computation theory of cellular automata
• Evolution complexity of the elementary cellular automaton of rule 22.
• Languages, equicontinuity and attractors in cellular automata
• Twenty Problems in the Theory of Cellular Automata

This page was built for publication: Complexity of evolution languages of the elementary cellular automaton of rule 146