SIAM Journal on Computing
On the power of one-way communication
Journal of the ACM (JACM)
On measuring nondeterminism in regular languages
Information and Computation
On the relation between ambiguity and nondeterminism in finite automata
Information and Computation
Measures of nondeterminism for pushdown automata
Journal of Computer and System Sciences
On real time one-way cellular array
Theoretical Computer Science
ACM SIGACT News
Alternation on cellular automata
Theoretical Computer Science
Pushdown automata with bounded nondeterminism and bounded ambiguity
Theoretical Computer Science - Special issue: Latin American theoretical informatics
Some relations between massively parallel arrays
Parallel Computing - Special issue: cellular automata
Signals in one-dimensional cellular automata
Theoretical Computer Science - Special issue: cellular automata
Measures of Nondeterminism in Finite Automata
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Computations with a restricted number of nondeterministic steps.
Computations with a restricted number of nondeterministic steps.
Cellular automata and formal languages
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
Real-time language recognition by one-dimensional cellular automata
Journal of Computer and System Sciences
On Interacting Automata with Limited Nondeterminism
Fundamenta Informaticae - Cellular Automata
Hi-index | 0.00 |
Nondeterministic cellular language acceptors are investigated. The nondeterminism is regarded as limited resource. For parallel devices it is natural to bound the nondeterminism in time and/or space. Depending on the length of the input, the number of allowed nondeterministic state transitions as well as the number of nondeterministic cells at all, is limited. For space-bounded nondeterminism it is shown that k+1 cells are not better than k, in case of one-way information flow. In the two-way case, one cell gains the power of unlimited nondeterminism. For the important real-time one-way arrays the range between deterministic and one guess per cell computations is studied. It is proved that there exists an infinite hierarchy of properly included families. By considering the relations with context-free languages, several relations between the devices in question are implied. Finally, a diagram is presented that summarizes relations between many cellular classes.