Computation theoretic aspects of cellular automata
From MaRDI portal
(Redirected from Publication:807035)
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
- scientific article; zbMATH DE number 3649996 (Why is no real title available?)
- scientific article; zbMATH DE number 4191143 (Why is no real title available?)
- scientific article; zbMATH DE number 3112450 (Why is no real title available?)
- scientific article; zbMATH DE number 3852966 (Why is no real title available?)
- scientific article; zbMATH DE number 4211534 (Why is no real title available?)
- scientific article; zbMATH DE number 4138816 (Why is no real title available?)
- scientific article; zbMATH DE number 3896305 (Why is no real title available?)
- scientific article; zbMATH DE number 3896307 (Why is no real title available?)
- scientific article; zbMATH DE number 4058875 (Why is no real title available?)
- scientific article; zbMATH DE number 4070331 (Why is no real title available?)
- scientific article; zbMATH DE number 4070371 (Why is no real title available?)
- scientific article; zbMATH DE number 4074491 (Why is no real title available?)
- scientific article; zbMATH DE number 4074492 (Why is no real title available?)
- scientific article; zbMATH DE number 4074493 (Why is no real title available?)
- scientific article; zbMATH DE number 4092780 (Why is no real title available?)
- scientific article; zbMATH DE number 4092782 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3745547 (Why is no real title available?)
- scientific article; zbMATH DE number 17562 (Why is no real title available?)
- scientific article; zbMATH DE number 3509706 (Why is no real title available?)
- scientific article; zbMATH DE number 3564949 (Why is no real title available?)
- scientific article; zbMATH DE number 3602692 (Why is no real title available?)
- scientific article; zbMATH DE number 3616736 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 3992940 (Why is no real title available?)
- scientific article; zbMATH DE number 3205673 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- A hierarchical classification of cellular automata
- Attractors in cellular automata
- Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems
- Classes of linear automata
- Computation and construction universality of reversible cellular automata
- Computation theory of cellular automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Deterministic one-way simulation of two-way real-time cellular automata and its related problems
- Endomorphisms and automorphisms of the shift dynamical system
- Finitely generated sofic systems
- Formal languages and global cellular automaton behavior
- Injectivity and surjectivity of parallel maps for cellular automata
- Iterative tree automata
- Local structure theory for cellular automata
- On the Limit Sets of Cellular Automata
- On the computational complexity of finite cellular automata
- On the computational power of totalistic cellular automata
- On totalistic systolic networks
- One-way bounded cellular automata
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Real-time language recognition by one-dimensional cellular automata
- Reversibility and surjectivity problems of cellular automata
- Rice's theorem for the limit sets of cellular automata
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Simple Computation-Universal Cellular Spaces
- Simple self-reproducing universal automata
- Statistical mechanics of cellular automata
- Subshifts of finite type and sofic systems
- Tesselations with local transformations
- The Nilpotency Problem of One-Dimensional Cellular Automata
- The undecidability of the domino problem
- Topological transformations as a tool in the design of systolic networks
- Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines
- Twenty Problems in the Theory of Cellular Automata
- Undecidability and nonperiodicity for tilings of the plane
Cited in
(44)- Cellular automata as a model of physical systems
- Tutorial on cellular automata
- Predicting nonlinear cellular automata quickly by decomposing them into linear ones
- scientific article; zbMATH DE number 1432321 (Why is no real title available?)
- Algebraic Properties of Cellular Automata: The Basis for Composition Technique
- Irrational speeds of configurations growth in generalized Pascal triangles
- Additive one-dimensional cellular automata are chaotic according to Devaney's definition of chaos
- scientific article; zbMATH DE number 17562 (Why is no real title available?)
- Randomness on full shift spaces
- Classifying 1D elementary cellular automata with the 0-1 test for chaos
- Computation theory of cellular automata
- Additive cellular automata and global injectivity
- On the computational power of totalistic cellular automata
- On the reduction of computational complexity of cellular automata
- Shift-symmetric configurations in two-dimensional cellular automata: irreversibility, insolvability, and enumeration
- scientific article; zbMATH DE number 4187123 (Why is no real title available?)
- A characterization of constant-time cellular automata computation
- Graph-theoretical characterization of invertible cellular automata
- A comparison of finite and cellular automata
- Multi-resolution cellular automata for real computation
- Parameter characterization of two-dimensional cellular automata rule space
- scientific article; zbMATH DE number 166925 (Why is no real title available?)
- Power consumption in cellular automata
- Symbolic dynamics of glider guns for some one-dimensional cellular automata
- On the dynamics and recursive properties of multidimensional symbolic systems
- Formal languages and global cellular automaton behavior
- Cellular automata composition techniques for spatial dynamics simulation
- Cellular automata and \(\delta\)-uniform BSS machines
- Chaos of elementary cellular automata rule 42 of Wolfram’s class II
- Regular unimodal systems and factors of finite automata
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- Computational mechanics of cellular automata: an example
- Theory of cellular automata: a survey
- scientific article; zbMATH DE number 919600 (Why is no real title available?)
- Chaos emerged on the `edge of chaos'
- Investigating topological chaos by elementary cellular automata dynamics
- Cellular automata and the sciences of complexity. II.
- Computational complexity of dynamical systems: the case of cellular automata
- On shift-invariant maximal filters and hormonal cellular automata
- An overview of computation in cellular automata
- scientific article; zbMATH DE number 1154159 (Why is no real title available?)
- Exploring nominal cellular automata
- Arithmetic representations of cellular automata
- Attractors in Restricted 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)
