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
On the computational complexity of finite cellular automata
Journal of Computer and System Sciences
On the classifiability of cellular automata
Theoretical Computer Science
A new kind of science
Cellular automata and intermediate degrees
Theoretical Computer Science
Cellular automata and intermediate degrees
Theoretical Computer Science
Almost periodic configurations on linear cellular automata
Fundamenta Informaticae - Special issue on cellular automata
Does the lit-only restriction make any difference for the σ-game and σ+-game?
European Journal of Combinatorics
Computational processes, observers and Turing incompleteness
Theoretical Computer Science
Cellular Automata, Decidability and Phasespace
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Universality and cellular automata
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Hi-index | 0.00 |
We exhibit one-dimensional cellular automata whose reachability and confluence problems have arbitrary r.e. degree of unsolvability.