Computational complexity of dynamical systems: the case of cellular automata
From MaRDI portal
Publication:948080
DOI10.1016/j.ic.2008.03.012zbMath1154.68081OpenAlexW2094943257MaRDI QIDQ948080
Luciano Margara, Pietro Di Lena
Publication date: 8 October 2008
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2008.03.012
Related Items (10)
Conservation of some dynamical properties for operations on cellular automata ⋮ Power Consumption in Cellular Automata ⋮ Topological dynamics of nondeterministic cellular automata ⋮ Decidable Properties of 2D Cellular Automata ⋮ Nondeterministic cellular automata ⋮ Some Formal Properties of Asynchronous Cellular Automata ⋮ Non-uniform Cellular Automata ⋮ On the complexity of asynchronous freezing cellular automata ⋮ Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties ⋮ On the directional dynamics of additive cellular automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the measure attractor of a cellular automaton
- Zero-dimensional dynamical systems, formal languages, and universality
- Expansiveness, entropy and polynomial growth for groups acting on subshifts by automorphisms
- A theory of complexity for continuous time systems
- Subshifts of finite type and sofic systems
- Classes of linear automata
- Attractors in cellular automata
- Languages, equicontinuity and attractors in cellular automata
- An Introduction to Symbolic Dynamics and Coding
- Subshift attractors of cellular automata
- Endomorphisms and automorphisms of the shift dynamical system
- Simple Computation-Universal Cellular Spaces
- Machines, Computations, and Universality
This page was built for publication: Computational complexity of dynamical systems: the case of cellular automata
