Computation theoretic aspects of cellular automata
From MaRDI portal
Publication:807035
DOI10.1016/0167-2789(90)90194-TzbMath0729.68052MaRDI QIDQ807035
L. P. Hurd, Karel II Culik, Sheng Yu
Publication date: 1990
Published in: Physica D (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (24)
Unnamed Item ⋮ Regular unimodal systems and factors of finite automata ⋮ Symbolic dynamics of glider guns for some one-dimensional cellular automata ⋮ Additive cellular automata and global injectivity ⋮ Predicting nonlinear cellular automata quickly by decomposing them into linear ones ⋮ A comparison of finite and cellular automata ⋮ Classifying 1D elementary cellular automata with the 0-1 test for chaos ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Power Consumption in Cellular Automata ⋮ Chaos emerged on the ‘edge of chaos’ ⋮ Attractors in Restricted Cellular Automata ⋮ Irrational speeds of configurations growth in generalized Pascal triangles ⋮ Parameter characterization of two-dimensional cellular automata rule space ⋮ Computational mechanics of cellular automata: an example ⋮ On the dynamics and recursive properties of multidimensional symbolic systems ⋮ Additive one-dimensional cellular automata are chaotic according to Devaney's definition of chaos ⋮ Shift-symmetric configurations in two-dimensional cellular automata: Irreversibility, insolvability, and enumeration ⋮ Unnamed Item ⋮ Investigating topological chaos by elementary cellular automata dynamics ⋮ Graph-theoretical characterization of invertible cellular automata ⋮ Chaos of elementary cellular automata rule 42 of Wolfram’s class II ⋮ Arithmetic representations of cellular automata ⋮ Formal languages and global cellular automaton behavior ⋮ Randomness on full shift spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterative tree automata
- Formal languages and global cellular automaton behavior
- A hierarchical classification of cellular automata
- Topological transformations as a tool in the design of systolic networks
- Computation theory of cellular automata
- Local structure theory for cellular automata
- On totalistic systolic networks
- Deterministic one-way simulation of two-way real-time cellular automata and its related problems
- Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems
- Computation and construction universality of reversible cellular automata
- Injectivity and surjectivity of parallel maps for cellular automata
- Finitely generated sofic systems
- Reversibility and surjectivity problems of cellular automata
- Rice's theorem for the limit sets of cellular automata
- Subshifts of finite type and sofic systems
- On the computational complexity of finite cellular automata
- Undecidability and nonperiodicity for tilings of the plane
- Tesselations with local transformations
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Real-time language recognition by one-dimensional cellular automata
- On the Limit Sets of Cellular Automata
- Statistical mechanics of cellular automata
- Classes of linear automata
- On the computational power of totalistic cellular automata
- Attractors in cellular automata
- Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines
- One-way bounded cellular automata
- The Nilpotency Problem of One-Dimensional Cellular Automata
- Twenty Problems in the Theory of Cellular Automata
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Simple self-reproducing universal automata
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Endomorphisms and automorphisms of the shift dynamical system
- The undecidability of the domino problem
- Simple Computation-Universal Cellular Spaces
This page was built for publication: Computation theoretic aspects of cellular automata
