Simulation of generalized synchronization processes on one-dimensional cellular automata

Authors:
Hiroshi Umeo;Naoki Kamikawa;Kouji Nishioka;Shunsuke Akiguchi
Affiliations:
Univ. of Osaka Electro-Communication, Faculty of Information Science and Technology, Osaka, Japan;Univ. of Osaka Electro-Communication, Faculty of Information Science and Technology, Osaka, Japan;Univ. of Osaka Electro-Communication, Faculty of Information Science and Technology, Osaka, Japan;Toyama National College of Maritime Technology, Toyama, Japan
Venue:
SMO'09 Proceedings of the 9th WSEAS international conference on Simulation, modelling and optimization
Year:
2009

Citing 8
Cited 0

Symmetrical one-dimensional cellular spaces

Information and Control
A note on symmetrical cellular spaces

Information Processing Letters
A six-state minimal time solution to the firing squad synchronization problem

Theoretical Computer Science
Smaller solutions for the firing squad

Theoretical Computer Science
Some New Generalized Synchronization Algorithms and Their Implementations for Large Scale Cellular Automata

UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Computation: finite and infinite machines

Computation: finite and infinite machines
A 4-states algebraic solution to linear cellular automata synchronization

Information Processing Letters
A design of symmetrical six-state 3n-step firing squad synchronization algorithms and their implementations

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cellular automata are considered to be a nice model of complex systems in which an infinite one-dimensional array of finite state machines (cells) updates itself in synchronous manner according to a uniform local rule. We study a generalized synchronization problem that gives a finite-state protocol for synchronizing a large scale of cellular automata with an initial initiator at any generalized position. We focus on the fundamental generalized firing squad synchronization algorithms operating in optimum- and non-optimum-steps on one-dimensional cellular arrays. A new eight-state algorithm is proposed in this paper. The eight-state optimum-step algorithm is the smallest one known at present in the class of generalized optimum-step firing squad synchronization protocols. Some new viewpoints and results are also given.