A Synchronization Problem in Two-Dimensional Cellular Automata

被引：0
|
作者：
Umeo, Hiroshi [1 ]
机构：
[1] Osaka Electrocommun Univ, Neyagawa, Osaka 5728530, Japan
来源：
NATURAL COMPUTING, PROCEEDINGS | 2009年 / 1卷
关键词：
MINIMAL TIME SOLUTION; ALGORITHMS;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The firing squad synchronization problem oil cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed so far. In the present paper, we give a survey on recent developments in firing squad synchronization algorithms for large-scale two-dimensional cellular automata. Several state-efficient implementations of the two-dimensional synchronization algorithms are given.
引用
收藏
页码：222 / 237
页数：16
相关论文
共 50 条
12345