Computational complexity of dynamical systems: the case of cellular automata
From MaRDI portal
Publication:948080
DOI10.1016/J.IC.2008.03.012zbMATH Open1154.68081OpenAlexW2094943257MaRDI QIDQ948080FDOQ948080
Authors: Pietro Di Lena, Luciano Margara 
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
Recommendations
- scientific article; zbMATH DE number 17562
- On the computational complexity of finite cellular automata
- Computation theoretic aspects of cellular automata
- scientific article; zbMATH DE number 4092781
- Complexity and linear cellular automata
- Computational complexity of the stability problem for elementary cellular automata
- Publication:3210926
- Complexity-theoretic aspects of expanding cellular automata
- Computation theory of cellular automata
- Computations on nondeterministic cellular automata
Cites Work
- Subshifts of finite type and sofic systems
- Title not available (Why is that?)
- An Introduction to Symbolic Dynamics and Coding
- Universality in elementary cellular automata
- Endomorphisms and automorphisms of the shift dynamical system
- Title not available (Why is that?)
- Classes of linear automata
- Languages, equicontinuity and attractors in cellular automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Attractors in cellular automata
- Simple Computation-Universal Cellular Spaces
- Subshift attractors of cellular automata
- On the measure attractor of a cellular automaton
- Expansiveness, entropy and polynomial growth for groups acting on subshifts by automorphisms
- Title not available (Why is that?)
- Machines, Computations, and Universality
- Evolution complexity of the elementary cellular automaton rule 18
- A theory of complexity for continuous time systems
- Zero-dimensional dynamical systems, formal languages, and universality
- Title not available (Why is that?)
Cited In (19)
- Computation and universality: Class IV versus Class III cellular automata
- Complexity analysis of time series generated by elementary cellular automata
- Title not available (Why is that?)
- Conservation of some dynamical properties for operations on cellular automata
- On the directional dynamics of additive cellular automata
- Compression-based investigation of the dynamical properties of cellular automata and other systems
- Cellular automata complexity threshold and classification: a geometric perspective
- On the complexity of asynchronous freezing cellular automata
- Power consumption in cellular automata
- On the computational power of totalistic cellular automata
- Title not available (Why is that?)
- Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
- Decidable Properties of 2D Cellular Automata
- Non-uniform Cellular Automata
- Nondeterministic cellular automata
- Some Formal Properties of Asynchronous Cellular Automata
- Title not available (Why is that?)
- Topological dynamics of nondeterministic cellular automata
- A comparison of finite and cellular automata
This page was built for publication: Computational complexity of dynamical systems: the case of cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q948080)
