A new class of the smallest FSSP partial solutions for 1D rings of length $n=2^{k}-1$

Abstract

A synchronization problem in cellular automata has been known as the Firing Squad Synchronization Problem (FSSP), where the FSSP gives a finite-state protocol for synchronizing a large scale of cellular automata. A quest for smaller state FSSP solutions has been an interesting problem for a long time. It has been shown by Balzer (Inf Control 10:22–42, 1967), Sanders (in: Jesshope, Jossifov, Wilhelmi (eds) Proceedings of the VI international workshop on parallel processing by cellular automata and arrays, Akademie, Berlin, 1994) and Berthiaume et al. (Theoret Comput Sci 320:213–228, 2004) that there exists no 4-state FSSP solution in arrays and rings. The number four is the state lower bound in the class of FSSP protocols. Umeo et al. (Parallel Process Lett 19(2):299–313, 2009), by introducing a concept of full versus partial FSSP solutions, provided a list of the smallest 4-state symmetric powers-of-2 FSSP protocols that can synchronize any one-dimensional (1D) ring cellular automata of length $n=2^{k}$ for any positive integer $k \ge 1$. Afterwards, Ng (in: Partial solutions for the firing squad synchronization problem on rings, ProQuest Publications, Ann Arbor, MI, 2011) also added a list of asymmetric FSSP partial solutions, thus completing the 4-state powers-of-2 FSSP partial solutions. A question whether there are any 4-state partial solutions for ring lengths other than powers-of-2 has remained open. In this paper, we answer the question by providing a new class of the smallest symmetric and asymmetric 4-state FSSP protocols that can synchronize any 1D ring of length $n=2^{k}-1$ for any positive integer $k \ge 2$. We show that the class includes a rich variety of FSSP protocols that consists of 39 symmetric and 132 asymmetric solutions, ranging from minimum to linear synchronization time. In addition, we make an investigation into several interesting properties of those partial solutions, such as swapping general states, transposed protocols, a duality property between them, and an inclusive property of powers-of-2 solutions.