On real-time cellular automata and trellis automata
Acta Informatica
Some remarks on pipeline processing by cellular automata
Computers and Artificial Intelligence
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
Seven-state solutions to the Firing Squad Synchronization Problem
Theoretical Computer Science
On real time one-way cellular array
Theoretical Computer Science
Generation of Primes by a One-Dimensional Real-Time Iterative Array
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Real-Time Generation of Primes by a One-Dimensional Cellular Automaton with 11 States
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
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
Computational Complexity in the Hyperbolic Plane
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Speeding-Up Cellular Automata by Alternations
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Efficient Universal Pushdown Cellular Automata and Their Application to Complexity
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Cellular automata with limited inter-cell bandwidth
Theoretical Computer Science
Fast iterative arrays with restricted inter-cell communication: constructions and decidability
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.01 |
In this paper, we investigate time-constructible functions in one-dimensional cellular automata (CA). It is shown that (i) if a function t(n) is computable by an O(t(n) - n)-time Turing machine, then t(n) is time-constructible by CA and (ii) if two functions are time-constructible by CA, then the sum, product, and exponential functions of them are time-constructible by CA. As an example for which time-constructible functions are required, we present a time-hierarchy theorem based on CA. It is shown that if t1(n) and t2(n) are time-constructible functions such that limn→∞t1(n)/t2(n)=0, then there is a language which can be recognized by a CA in t2(n) time but not by any CA in t1(n) time.