Computational classification of cellular automata
From MaRDI portal
Publication:2869784
Recommendations
Cites work
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 778215 (Why is no real title available?)
- scientific article; zbMATH DE number 873158 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Abstract Geometrical Computation and Computable Analysis
- Cellular automata and intermediate degrees.
- Computation theory of cellular automata
- Endomorphisms and automorphisms of the shift dynamical system
- Handbook of computability theory
- Languages, equicontinuity and attractors in cellular automata
- On the classifiability of cellular automata
- On the computational complexity of finite cellular automata
- Small fast universal Turing machines
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
- The Friedberg-Muchnik Theorem Re-Examined
- The complexity of reversible cellular automata
- Transition phenomena in cellular automata rule space
- Twenty Problems in the Theory of Cellular Automata
Cited in
(20)- Mining a class of decision problems for one-dimensional cellular automata
- scientific article; zbMATH DE number 4074492 (Why is no real title available?)
- Progress, gaps and obstacles in the classification of cellular automata
- Bulking II: Classifications of cellular automata
- Complexity of inferring local transition functions of discrete dynamical systems
- A hierarchical classification of cellular automata
- Overview: PCA models and issues
- Iteration of invertible transductions
- Inferring local transition functions of discrete dynamical systems from observations of system behavior
- On the undecidability of attractor properties for cellular automata
- Exemples de classes d'automates cellulaires
- Machines, Computations, and Universality
- Target-oriented self-structuring in classifying cellular automata
- On the classifiability of cellular automata
- Complexity classes on spatially periodic cellular automata
- An information-based classification of elementary cellular automata
- A comprehensive taxonomy of cellular automata
- Computation theory of cellular automata
- Characterization of nonlinear dynamic systems for engineering purposes – a partial review
- Cellular automata, tilings and (un)computability
This page was built for publication: Computational classification of cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2869784)