A complexity analysis of the elementary cellular automaton of rule 122

DOI10.1007/BF02900420zbMath1103.68477MaRDI QIDQ1428842

Zhisong Jiang

Publication date: 18 May 2004

Published in: Chinese Science Bulletin (Search for Journal in Brave)

zbMATH Keywords

context-free languageregular languagelimit language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05)

Related Items

The relationships of three elementary cellular automata, Progress, gaps and obstacles in the classification of cellular automata, Inferring the Limit Behavior of Some Elementary Cellular Automata

Cites Work

• Computation theory of cellular automata
• Complexity
• Grammatical Complexity and One-Dimensional Dynamical Systems
• A helpful result for proving inherent ambiguity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item