Computation theoretic aspects of cellular automata
From MaRDI portal
Publication:807035
DOI10.1016/0167-2789(90)90194-TzbMATH Open0729.68052MaRDI QIDQ807035FDOQ807035
Authors: L. P. Hurd, Karel II Culik, Sheng Yu 
Publication date: 1990
Published in: Physica D (Search for Journal in Brave)
Recommendations
- Theory of cellular automata: a survey
- Cellular automata as a model of physical systems
- Computational complexity of dynamical systems: the case of cellular automata
- scientific article; zbMATH DE number 1555206
- Cellular automata: From a theoretical parallel computational model to its application to complex systems
Cites Work
- Subshifts of finite type and sofic systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Endomorphisms and automorphisms of the shift dynamical system
- Title not available (Why is that?)
- Local structure theory for cellular automata
- On the Limit Sets of Cellular Automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Classes of linear automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reversibility and surjectivity problems of cellular automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Statistical mechanics of cellular automata
- Title not available (Why is that?)
- The Nilpotency Problem of One-Dimensional Cellular Automata
- The undecidability of the domino problem
- Attractors in cellular automata
- Tesselations with local transformations
- Simple Computation-Universal Cellular Spaces
- Title not available (Why is that?)
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Computation theory of cellular automata
- Undecidability and nonperiodicity for tilings of the plane
- Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems
- Title not available (Why is that?)
- On the computational power of totalistic cellular automata
- Title not available (Why is that?)
- One-way bounded cellular automata
- Twenty Problems in the Theory of Cellular Automata
- Rice's theorem for the limit sets of cellular automata
- On the computational complexity of finite cellular automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computation and construction universality of reversible cellular automata
- Real-time language recognition by one-dimensional cellular automata
- Title not available (Why is that?)
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- A hierarchical classification of cellular automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finitely generated sofic systems
- Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines
- Title not available (Why is that?)
- Iterative tree automata
- Topological transformations as a tool in the design of systolic networks
- On totalistic systolic networks
- Deterministic one-way simulation of two-way real-time cellular automata and its related problems
- Injectivity and surjectivity of parallel maps for cellular automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simple self-reproducing universal automata
- Formal languages and global cellular automaton behavior
Cited In (44)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Shift-symmetric configurations in two-dimensional cellular automata: Irreversibility, insolvability, and enumeration
- Cellular automata and the sciences of complexity. II.
- On the reduction of computational complexity of cellular automata
- Randomness on full shift spaces
- Parameter characterization of two-dimensional cellular automata rule space
- Cellular automata and \(\delta\)-uniform BSS machines
- Regular unimodal systems and factors of finite automata
- Title not available (Why is that?)
- Additive one-dimensional cellular automata are chaotic according to Devaney's definition of chaos
- Cellular automata composition techniques for spatial dynamics simulation
- Theory of cellular automata: a survey
- Algebraic Properties of Cellular Automata: The Basis for Composition Technique
- Chaos of elementary cellular automata rule 42 of Wolfram’s class II
- Chaos emerged on the `edge of chaos'
- An overview of computation in cellular automata
- Predicting nonlinear cellular automata quickly by decomposing them into linear ones
- Power consumption in cellular automata
- On the dynamics and recursive properties of multidimensional symbolic systems
- Title not available (Why is that?)
- Investigating topological chaos by elementary cellular automata dynamics
- A characterization of constant-time cellular automata computation
- Symbolic dynamics of glider guns for some one-dimensional cellular automata
- On the computational power of totalistic cellular automata
- Cellular automata as a model of physical systems
- Tutorial on cellular automata
- Title not available (Why is that?)
- Classifying 1D elementary cellular automata with the 0-1 test for chaos
- Exploring nominal cellular automata
- Computation theory of cellular automata
- On shift-invariant maximal filters and hormonal cellular automata
- Irrational speeds of configurations growth in generalized Pascal triangles
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- Formal languages and global cellular automaton behavior
- Attractors in Restricted Cellular Automata
- Graph-theoretical characterization of invertible cellular automata
- Multi-resolution cellular automata for real computation
- Additive cellular automata and global injectivity
- A comparison of finite and cellular automata
- Computational complexity of dynamical systems: the case of cellular automata
- Computational mechanics of cellular automata: an example
- Arithmetic representations of cellular automata
This page was built for publication: Computation theoretic aspects of cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807035)
