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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balzer, R.: An 8-State Minimal Time Solution to the Firing Squad Synchronization Problem. Information and Control 10, 22–42 (1967)
Gerken, H.-D.: Über Synchronisations - Probleme bei Zellularautomaten. Diplomarbeit, Institut für Theoretische Informatik. Technische Universität Braunschweig (1987)
Goto, E.: A minimum time solution of the firing squad synchronization problem. Courses Notes for Applied Mathematics 298, 52–59 (1962)
Mazoyer, J.: A Six-State Minimal-Time Solution to the Firing Squad Synchronization Problem. Theoretical Computer Science 50, 183–238 (1987)
Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)
Moore, E.F.: The Firing Squad Synchronization Problem. In: Moore, E.F. (ed.) Sequential Machines. Selected Papers, pp. 213–214. Addison-Wesley, Reading (1964)
Settle, A., Simon, J.: Non-Minimal Time Solutions for the Firing Squad Synchronization Problem. Technical Report 97-08, University of Chicago (1997)
Umeo, H., Kamikawa, N.: A 4-states solution to the firing squad based on Wolfram’s rule 150. Private communication (2007)
Umeo, H., Maeda, M., Hongyo, K.: A Design of Symmetrical Six-State 3n-Steps Firing Squad Synchronization Algorithms and Their Implementations. In: El Yacoubi, S., Chopard, B., Bandini, S. (eds.) ACRI 2006. LNCS, vol. 4173, pp. 157–168. Springer, Heidelberg (2006)
Umeo, H., Yanagihara, T.: A smallest five-state solution to the firing squad synchronization problem. In: Durand-Lose, J., Margenstern, M. (eds.) MCU 2007. LNCS, vol. 4664, pp. 291–302. Springer, Heidelberg (2007)
Waksman, A.: An Optimum Solution to the Firing Squad Synchronization Problem. Information and Control 9, 66–78 (1966)
Wolfram, S.: Cellular Automata and Complexity: Collected Papers. Westview Press (2002)
Yunès, J.-B.: Seven States Solutions to the Firing Squad Synchronization Problem. Theoretical Computer Science 127(2), 313–332 (1994)
Yunès, J.-B.: An Intrinsically non Minimal-Time Minsky-like 6-States Solution to the Firing Squad Synchronization Problem. RAIRO ITA/TIA 42(1), 55–68 (2008)
Yunès, J.-B.: A 4-states Algebraic Solution to Linear Cellular Automata Synchronization. International Processing Letters (2008), doi: 10.1016/j.ipl.2008.01.009
Yunès, J.-B.: Goto’s construction and Pascal’s triangle: new insights into cellular automata synchronization. In: Durand, B. (ed.) JAC 2008, Uzès, France, April 21–25, pp. 195–203. MCCME Publishing House Moscow (2008)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Umeo, H., Yunès, JB., Kamikawa, N. (2008). About 4-States Solutions to the Firing Squad Synchronization Problem. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds) Cellular Automata. ACRI 2008. Lecture Notes in Computer Science, vol 5191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79992-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-79992-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79991-7
Online ISBN: 978-3-540-79992-4
eBook Packages: Computer ScienceComputer Science (R0)