Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results
From MaRDI portal
(Redirected from Publication:1297435)
Recommendations
- On pointwise periodicity in tilings, cellular automata, and subshifts
- Nilpotency and periodic points in non-uniform cellular automata
- On the undecidability of attractor properties for cellular automata
- ON A CHARACTERIZATION OF CELLULAR AUTOMATA IN TILINGS OF THE HYPERBOLIC PLANE
- Mathematical Foundations of Computer Science 2003
- Periodic points for onto cellular automata
- The Injectivity of the Global Function of a Cellular Automaton in the Hyperbolic Plane is Undecidable
- Analytic proof of the attractors of a class of cellular automaton
- Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines
- Local non-periodic order and diam-mean equicontinuity on cellular automata
Cites work
- scientific article; zbMATH DE number 3896307 (Why is no real title available?)
- Classifying circular cellular automata
- On the Limit Sets of Cellular Automata
- Remarks on Berger's paper on the domino problem
- The Nilpotency Problem of One-Dimensional Cellular Automata
- The undecidability of the domino problem
- Undecidability and nonperiodicity for tilings of the plane
Cited in
(6)- scientific article; zbMATH DE number 7298593 (Why is no real title available?)
- Bulking II: Classifications of cellular automata
- Progress, gaps and obstacles in the classification of cellular automata
- Four states are enough!
- Nilpotency and periodic points in non-uniform cellular automata
- Communication complexity meets cellular automata: necessary conditions for intrinsic universality
This page was built for publication: Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297435)
