On real time one-way cellular array
Theoretical Computer Science
Language not recognizable in real time by one-way cellular automata
Theoretical Computer Science
On optimal solutions to the firing squad synchronization problem
Theoretical Computer Science - Special issue on universal machines and computations
Synchronization of a line of identical processors at a given time
Fundamenta Informaticae
Signals in one-dimensional cellular automata
Theoretical Computer Science - Special issue: cellular automata
Generation of Primes by a One-Dimensional Real-Time Iterative Array
Journal of the ACM (JACM)
Parallel Computing - Special issue on cellular automata: from modeling to applications
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
Linear Time Language Recognition on Cellular Automata with Restricted Communication
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Real-time language recognition by one-dimensional cellular automata
Journal of Computer and System Sciences
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Fundamenta Informaticae - Cellular Automata
Hi-index | 0.00 |
It is shown that an infinite prime sequence can be generated in real-time by a cellular automaton having 1-bit inter-cell communications (CA_{1-bit}). The algorithm presented is based on the classical sieve of Eratosthenes, and its implementation will be made on a CA_{1-bit} using 34 internal states and 71 transition rules.