scientific article; zbMATH DE number 17562
From MaRDI portal
Publication:3974887
zbMATH Open0756.68081MaRDI QIDQ3974887FDOQ3974887
Authors: K. Sutner 
Publication date: 26 June 1992
Title of this publication is not available (Why is that?)
Recommendations
- On the computational complexity of finite cellular automata
- Computational complexity of dynamical systems: the case of cellular automata
- Computation theoretic aspects of cellular automata
- Computation theory of cellular automata
- scientific article; zbMATH DE number 4092781
- Complexity and linear cellular automata
- The complexity of permutive cellular automata
- Complexity-theoretic aspects of expanding cellular automata
- On the reduction of computational complexity of cellular automata
- Cellular automata: descriptional complexity and decidability
Cited In (19)
- Title not available (Why is that?)
- Constrained Eden
- Progress, gaps and obstacles in the classification of cellular automata
- Kolmogorov complexity and cellular automata classification
- Complexity and universality of iterated finite automata
- Cellular automata and intermediate degrees.
- Machines, Computations, and Universality
- Exemples de classes d'automates cellulaires
- Asymptotic Cellular Complexity
- Cellular automata and communication complexity
- On the classifiability of cellular automata
- A characterization of constant-time cellular automata computation
- A comprehensive taxonomy of cellular automata
- On the computational power of totalistic cellular automata
- Computation theoretic aspects of cellular automata
- Computation theory of cellular automata
- On the computational complexity of finite cellular automata
- The computational complexity of Angry Birds
- Computational complexity of dynamical systems: the case of cellular automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3974887)
