A Design of Real-Time Non-Regular Sequence Generation Algorithms and Their Implementations on Cellular Automata with 1-Bit Inter-Cell Communications

Authors:
Hiroshi Umeo;Naoki Kamikawa
Affiliations:
Faculty of Information Science and Technology, Osaka Electro-Communication University, Neyagawa-shi, Hatsu-cho, 18-8, Osaka, 572-8530, Japan;Noritsu Koki Co., Ltd., Wakayama-shi, Umehara, 579-1, Wakayama, 640-8550, Japan
Venue:
Fundamenta Informaticae - Cellular Automata
Year:
2002

Citing 9
Cited 2

A linear speed-up theorem for cellular automata

Theoretical Computer Science - Special issue on logic and applications to computer science
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
Parallel Turing machines with one-head control units and cellular automata

Theoretical Computer Science - Special issue: cellular automata
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)
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 language recognition by one-dimensional cellular automata

Journal of Computer and System Sciences

State-Efficient One-Bit Communication Solutions for Some Classical Cellular Automata Problems

Fundamenta Informaticae - Special issue on DLT'04
Real-Time Generation of Primes by a 1-Bit-Communication Cellular Automaton

Fundamenta Informaticae - Cellular Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a special new class of cellular automata(CA) whose inter-cell communication is restricted to 1-bit. Several design examples for 1-bit inter-cell communication cellular algorithms are given. It is shown that infinite non-regular sequences such as {2^n | n = 1, 2, 3,..}, {n^2 |n = 1, 2, 3,..} and Fibonacci sequences can be generated in real-time by cellular automata with 1-bit inter-cell communications. In addition, twice real-time prime generation algorithm is also given.