Abstract
We present some elements of a new family of time-optimal solutions to a less restrictive firing squad synchronization problem. These solutions are all built on top of some elementary algebraic cellular automata. Thus, this gives a very new insight on the problem and a more general way of computing on cellular automata. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Umeo, H., Yunès, J. B., & Kamikawa, N. (2008). About 4-states solutions to the firing squad synchronization problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5191 LNCS, pp. 108–113). https://doi.org/10.1007/978-3-540-79992-4_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
