Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Undecidability of CA classification schemes
Complex Systems
Classifying circular cellular automata
Physica D
Computational mechanics of cellular automata: an example
Proceedings of the workshop on Lattice dynamics
Linear cellular automata and Fischer automata
Parallel Computing - Special issue: cellular automata
On the classifiability of cellular automata
Theoretical Computer Science
A new kind of science
Cellular automata and intermediate reachability problems
Fundamenta Informaticae - Special issue on cellular automata
Cellular automata and intermediate degrees
Theoretical Computer Science
Cellular Automata
The complexity of reversible cellular automata
Theoretical Computer Science - Special issue: Theoretical aspects of cellular automata
Defect particle kinematics in one-dimensional cellular automata
Theoretical Computer Science
Cellular Automata, Decidability and Phasespace
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Turing universality in dynamical systems
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Hi-index | 0.00 |
We study computational properties of linear cellular automata on configurations that differ from spatially periodic ones in only finitely many places. It is shown that the degree structure of the orbits of cellular automata is the same on these configurations as on the space of finite configurations. We also show that it is undecidable whether the cellular automaton exhibits complicated behavior on configurations of sufficiently long spatial periods and exhibit cellular automata with undecidable orbits whose orbits on backgrounds of all fixed sizes are decidable.