The complexity of limit languages of cellular automata: An example
From MaRDI portal
Recommendations
- Complexity of limit language of the elementary cellular automaton of Rule 22
- Arithmetical complexity of the language of generic limit sets of cellular automata
- scientific article; zbMATH DE number 4070371
- Complexity of generic limit sets of cellular automata
- \(\mu\)-limit sets of cellular automata from a computational complexity perspective
- On the computational complexity of finite cellular automata
- Descriptional complexity of limited automata
- On the Limit Sets of Cellular Automata
- Limited automata: properties, complexity and variants
- Cellular automata: descriptional complexity and decidability
Cited in
(11)- On the limit set of some universal cellular automata
- A complexity analysis of the elementary cellular automaton of rule 122
- Complexity analysis of time series generated by elementary cellular automata
- Complexity of limit language of the elementary cellular automaton of Rule 22
- Progress, gaps and obstacles in the classification of cellular automata
- Arithmetical complexity of the language of generic limit sets of cellular automata
- scientific article; zbMATH DE number 4195191 (Why is no real title available?)
- scientific article; zbMATH DE number 4070371 (Why is no real title available?)
- A note on decidability of cellularity
- Complexity of evolution languages of the elementary cellular automaton of rule 146
- The relationships of three elementary cellular automata
This page was built for publication: The complexity of limit languages of cellular automata: An example
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941786)
