Inferring the Limit Behavior of Some Elementary Cellular Automata
From MaRDI portal
Publication:4599770
DOI10.1142/S0218127417300282zbMath1377.37022OpenAlexW2744072217MaRDI QIDQ4599770
Pedro P. B. de Oliveira, Eurico L. P. Ruivo
Publication date: 5 January 2018
Published in: International Journal of Bifurcation and Chaos (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218127417300282
complexityattractorregular languageelementary cellular automatafactorial languagelimit behaviorprocess graphs
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of evolution languages of the elementary cellular automaton of rule 146
- The relationships of three elementary cellular automata
- A search algorithm for subshift attractors of cellular automata
- Computational mechanics of cellular automata: an example
- Computation theory of cellular automata
- The attractor-basin portrait of a cellular automaton
- A complexity analysis of the elementary cellular automaton of rule 122
- Theory of cellular automata: a survey
- Subshifts of finite type and sofic systems
- Complexity of limit language of the elementary cellular automaton of Rule 22
- Catalan numbers, Dyck language and time series of elementary cellular automaton of rule 56
- Block transformations of one-dimensional deterministic cellular automaton rules
- A Search Algorithm for the Maximal Attractor of a Cellular Automaton
- Twenty Problems in the Theory of Cellular Automata
- Turing Degrees of Limit Sets of Cellular Automata
- Limit sets of stable cellular automata
This page was built for publication: Inferring the Limit Behavior of Some Elementary Cellular Automata
