Random sequence generation by cellular automata
Advances in Applied Mathematics
Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Classifying circular cellular automata
Physica D
Cellular automata, &ohgr;&ohgr;-regular sets, and sofic systems
Discrete Applied Mathematics - Formal language theory
The nilpotency problem of one-dimensional cellular automata
SIAM Journal on Computing
Complexity and real computation
Complexity and real computation
Linear cellular automata and Fischer automata
Parallel Computing - Special issue: cellular automata
Computable analysis: an introduction
Computable analysis: an introduction
A new kind of science
Word Processing in Groups
Cellular automata and intermediate reachability problems
Fundamenta Informaticae - Special issue on cellular automata
Automatic Presentations of Structures
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Cellular automata and intermediate degrees
Theoretical Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Automatic structures: overview and future directions
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Almost periodic configurations on linear cellular automata
Fundamenta Informaticae - Special issue on cellular automata
Two-state, reversible, universal cellular automata in three dimensions
Proceedings of the 2nd conference on Computing frontiers
Physical constraints on hypercomputation
Theoretical Computer Science
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phasespace of these automata, construed as automatic structures over infinite words. In dimension one, slightly more than the first order theory is decidable but the addition of an orbit predicate results in undecidability. We comment on connections between this “what you see is what you get” model and the lack of natural intermediate degrees.