DocumentCode
3130680
Title
On Generalized FSSP Algorithms for Two-Dimensional Cellular Automata
Author
Umeo, Hiroshi
Author_Institution
Univ. of Osaka Electro-Commun., Neyagawa, Japan
fYear
2013
fDate
4-6 Dec. 2013
Firstpage
533
Lastpage
539
Abstract
Synchronizing cellular automata has been known as the firing squad synchronization problem (FSSP). In the present paper, we construct a survey on recent developments in generalized two-dimensional FSSP algorithms.
Keywords
cellular automata; synchronisation; firing squad synchronization problem; generalized two-dimensional FSSP algorithms; two-dimensional cellular automata; Automata; History; Laser mode locking; Shape; Synchronization; Three-dimensional displays; Time complexity; FSSP; cellular automaton; firing squad synchronization problem; generalized FSSP;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing and Networking (CANDAR), 2013 First International Symposium on
Conference_Location
Matsuyama
Print_ISBN
978-1-4799-2795-1
Type
conf
DOI
10.1109/CANDAR.2013.95
Filename
6726957
Link To Document