| Budget Amount *help |
¥3,900,000 (Direct Cost: ¥3,000,000、Indirect Cost: ¥900,000)
Fiscal Year 2011: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2010: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2009: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
|
|---|
| Research Abstract |
We study a firing squad synchronization problem(FSSP) that gives a finite-state protocol for synchronizing cellular automata(CA). In this research project, we made an investigation into smaller FSSP solutions not only for one-dimensional(1D) but multi-dimensional CAs. We present a class of smallest 4-state partial solutions for 1D the CAs. It is shown that there exists a 7-state square synchronizer for 2D square arrays, which is a smallest solution for square arrays, known at present. We also show that there exists a nine-state FSSP solution for 2D rectangular arrays. In the last, we have proposed a new class of optimum-time multi-dimensional FSSP algorithms based on recursive-halving marking.
|
