Firing squad synchronization problem in reversible cellular automata

Katsunobu Imai, Kenichi Morita
1996 Theoretical Computer Science  
We studied the Firing Squad Synchronization Problem (FSSP) on reversible (i.e., backward deterministic) cellular automata (RCA). First we proved that, in the case of RCA, there is no solution under the usual condition for FSSP where the firing state is only one. So we defined a little weaker condition suitable for RCA in which finite number of firing states are allowed. We showed that Minsky's solution in time 3n can be embedded in an RCA with 99 states that satisfies the new condition. We used
more » ... the framework of partitioned CA (PCA), which is regarded as a subclass of CA, for making ease of constructing RCA.
doi:10.1016/0304-3975(96)00016-3 fatcat:chjdj3osizdd7lhfywwckd3acu