A Synchronization Problem on 1-Bit Communication Cellular Automata

@inproceedings{Umeo2003ASP,
  title={A Synchronization Problem on 1-Bit Communication Cellular Automata},
  author={Hiroshi Umeo and Koshi Michisaka and Naoki Kamikawa},
  booktitle={International Conference on Computational Science},
  year={2003}
}
We study a classical firing squad synchronization problem for a large sale of one- and two-dimensional cellular automata having 1-bit inter-cell communications (CA1-bit). First, it is shown that there exists a one-dimensional CA1-bit that can synchronize n cells with the general on the kth cell in n + max (k, n - k + 1) steps, where the performance is two steps larger than the optimum one that was developed for O(1)-bit communication model. Next, we give a two-dimensional CA1-bit which can… CONTINUE READING