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 - Special issue on cellular automata
Year:
2002

Citing 8
Cited 12

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 generation of primes by a 1-bit-communication cellular automaton

Fundamenta Informaticae - Special issue on cellular automata
State-Efficient One-Bit Communication Solutions for Some Classical Cellular Automata Problems
Cellular Automata with Sparse Communication

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
On One-way One-bit O (One)-message Cellular Automata

Electronic Notes in Theoretical Computer Science (ENTCS)
An infinite prime sequence can be generated in real-time by a 1-bit inter-cell communication cellular automaton

DLT'02 Proceedings of the 6th international conference on Developments in language theory
A comparative investigation into optimum-time synchronization protocols for a large scale of one dimensional cellular automata

ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Cellular automata with sparse communication

Theoretical Computer Science
Sequence generation problem on communication-restricted cellular automata

NOLASC'06 Proceedings of the 5th WSEAS international conference on Non-linear analysis, non-linear systems and chaos
Cellular automata with limited inter-cell bandwidth

Theoretical Computer Science
Nature-based problems in cellular automata

CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
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
State-Efficient firing squad synchronization protocols for communication-restricted cellular automata

ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry

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 {2n| n = 1, 2, 3, ..}, {n2|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.