On real-time cellular automata and trellis automata
Acta Informatica
A six-state minimal time solution to the firing squad synchronization problem
Theoretical Computer Science
SIAM Journal on Computing
On the power of one-way communication
Journal of the ACM (JACM)
Relating the power of cellular arrays to their closure properties
Theoretical Computer Science
Two-dimensional iterative arrays: characterizations and applications
Theoretical Computer Science - International Symposium on Mathematical Foundations of Computer Science, Bratisl
On real time one-way cellular array
Theoretical Computer Science
Nondeterministic, probabilistic and alternating computations on cellular array models
Theoretical Computer Science
Alternation on cellular automata
Theoretical Computer Science
Linear speed-up for cellular automata synchronizers and applications
Theoretical Computer Science
Computations on nondeterministic cellular automata
Information and Computation
One Guess One-Way Cellular Arrays
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Speeding-up Single-Tape Nondeterministic Computations by Single Alternation, with Separation Results
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
On Time-Constructible Functions in One-Dimensional Cellular Automata
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
IEEE Transactions on Computers
Real-time language recognition by one-dimensional cellular automata
Journal of Computer and System Sciences
| Hi-index | 0.01 |
There are two simple models of cellular automata: a semiinfinite array (with left boundary) of cells with sequential input mode, called an iterative array (IA), and a finite array (delimited at both ends) of n cells with parallel input mode, called a bounded cellular array (BCA). This paper presents a quadratic speedup theorem for IAs and an exponential speedup theorem for BCAs by using alternations. It is shown that for any computable functions s(n), t(n) ≥ n, every s(n)t(n)- time deterministic IA can be simulated by an O(s(n))-space O(t(n))- time alternating IA. Since any t(n)-time IA is t(n)-space bounded, every (t(n))2-time deterministic IA can be simulated by an O(t(n))-time alternating IA. This leads to a separation result: There is a language which can be accepted by an alternating IA in O(t(n)) time but not by any deterministic IA in O(t(n)) time. It is also shown that every t(n)- time nondeterministic BCA can be simulated by a linear-time alternating BCA.