Complexity analysis of time series generated by elementary cellular automata

DOI10.1007/s11766-005-0001-0zbMath1086.37007OpenAlexW2004321147WikidataQ60692049 ScholiaQ60692049MaRDI QIDQ2574417

Huimin Xie, Dakang Qin

Publication date: 21 November 2005

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

Full work available at URL: https://doi.org/10.1007/s11766-005-0001-0

zbMATH Keywords

time seriessymbolic dynamicsformal languagesChomsky hierarchydistinct excluded blockelementary cellular automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Symbolic dynamics (37B10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Uses Software

• OEIS

Cites Work

• Formal languages and global cellular automaton behavior
• A hierarchical classification of cellular automata
• Topological and measure-theoretic properties of one-dimensional cellular automata
• Algebraic properties of cellular automata
• Random sequence generation by cellular automata
• An on-line version of ``The Encyclopedia of Integer Sequences
• Catalan numbers, Dyck language and time series of elementary cellular automaton of rule 56
• Classes of linear automata
• Grammatical Complexity and One-Dimensional Dynamical Systems
• The complexity of limit languages of cellular automata: An example
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity analysis of time series generated by elementary cellular automata