Simple Computation-Universal Cellular Spaces
Journal of the ACM (JACM)
Computation: finite and infinite machines
Computation: finite and infinite machines
Pattern reproduction in tessellation automata of arbitrary dimension
Journal of Computer and System Sciences
A completeness problem for pattern generation in tessellation automata
Journal of Computer and System Sciences
Tessellation structures for reproduction of arbitrary patterns
Journal of Computer and System Sciences
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
Journal of Computer and System Sciences
The general σ all-ones problem for trees
Discrete Applied Mathematics
Surjectivity of nondeterministic parallel maps induced bynondeterministic cellular automata
Journal of Computer and System Sciences
Cellular Automata and Intermediate Reachability Problems
Fundamenta Informaticae - Cellular Automata
| Hi-index | 0.00 |
A configuration is said to be with finite support if the states of all but fintely many cells in the array are quiescent. The results are as follows. It is recursively unsolvable when d=2, for a configuration c with finite support in a d-dimensional cellular automaton, whether or not:o1.c is in the image of the parallel map for the cellular automaton. 2.c is in the image of the parallel map for the cellular automaton restricted to the set of configurations with finite support. Further properties of parallel maps are also considered.