Sequence generation problem on communication-restricted cellular automata

Authors:
Naoki Kamikawa;Hiroshi Umeo
Affiliations:
Univ. of Osaka Electro-Communication, Faculty of Information Science and Technology, Neyagawa-shi, Osaka, Japan;Univ. of Osaka Electro-Communication, Faculty of Information Science and Technology, Neyagawa-shi, Osaka, Japan
Venue:
NOLASC'06 Proceedings of the 5th WSEAS international conference on Non-linear analysis, non-linear systems and chaos
Year:
2006

Citing 12
Cited 0

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)
Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton

Parallel Computing - Special issue on cellular automata: from modeling to applications
A design of real-time non-regular sequence generation algorithms and their implementations on cellular automata with 1-bit inter-cell communications

Fundamenta Informaticae - Special issue on cellular automata
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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cellular automata (CA) are considered to be a non-linear model of complex systems in which an infinite one-dimensional array of finite state machines (cells) updates itself in a synchronous manner according to a uniform local rule. We study a sequence generation problem on a special restricted class of cellular automata having 1-bit inter-cell communications (CA1-bit) and propose several state-efficient real-time sequence generation algorithms for non-regular sequences.