{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:39:18Z","timestamp":1742913558325,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319219080"},{"type":"electronic","value":"9783319219097"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21909-7_22","type":"book-chapter","created":{"date-parts":[[2015,7,24]],"date-time":"2015-07-24T06:16:04Z","timestamp":1437718564000},"page":"231-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Class of Non-optimum-time 3n-Step FSSP Algorithms - A Survey"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Umeo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masashi","family":"Maeda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akihiro","family":"Sousa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kiyohisa","family":"Taguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,25]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/S0019-9958(67)90032-0","volume":"10","author":"R Balzer","year":"1967","unstructured":"Balzer, R.: An 8-state minimal time solution to the firing squad synchronization problem. Inf. Control 10, 22\u201342 (1967)","journal-title":"Inf. Control"},{"issue":"3","key":"22_CR2","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1145\/321281.321290","volume":"12","author":"PC Fischer","year":"1965","unstructured":"Fischer, P.C.: Generation of primes by a one-dimensional real-time iterative array. J. of ACM 12(3), 388\u2013394 (1965)","journal-title":"J. of ACM"},{"key":"22_CR3","unstructured":"Gerken, H.-D.: \u00dcber Synchronisations-Probleme bei Zellularautomaten. Diplomarbeit, Institut f\u00fcr Theoretische Informatik, Technische Universit\u00e4t Braunschweig, pp. 50 (1987)"},{"key":"22_CR4","unstructured":"Goto, E.: A minimal time solution of the firing squad problem. Dittoed Course Notes for Applied Mathematics, 298, pp. 52\u201359. Harvard University (1962)"},{"issue":"3","key":"22_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1080\/00207727108920195","volume":"2","author":"GT Herman","year":"1971","unstructured":"Herman, G.T.: Models for cellular interactions in development without polarity of individual cells. I. General description and the problem of universal computing ability. Int. J Syst. Sci. 2(3), 271\u2013289 (1971)","journal-title":"Int. J Syst. Sci."},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1080\/00207727208920256","volume":"3","author":"GT Herman","year":"1972","unstructured":"Herman, G.T.: Models for cellular interactions in development without polarity of individual cells. II. Problems of synchronization and regulation. Int. J Syst. Sci. 3(2), 149\u2013175 (1972)","journal-title":"Int. J Syst. Sci."},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/0020-0190(87)90221-3","volume":"25","author":"Y Kobuchi","year":"1987","unstructured":"Kobuchi, Y.: A note on symmetrical cellular spaces. Inf. Process. Lett. 25, 413\u2013415 (1987)","journal-title":"Inf. Process. Lett."},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(87)90124-1","volume":"50","author":"J Mazoyer","year":"1987","unstructured":"Mazoyer, J.: A six-state minimal time solution to the firing squad synchronization problem. Theor. Comput. Sci. 50, 183\u2013238 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR9","first-page":"28","volume-title":"Computation: Finite and Infinite Machines","author":"M Minsky","year":"1967","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines, pp. 28\u201329. Prentice Hall, New Jersey (1967)"},{"key":"22_CR10","first-page":"213","volume-title":"Sequential Machines: Selected Papers","author":"EF Moore","year":"1964","unstructured":"Moore, E.F.: The firing squad synchronization problem. In: Moore, F. (ed.) Sequential Machines: Selected Papers, pp. 213\u2013214. Addison-Wesley, Reading MA. (1964)"},{"key":"22_CR11","unstructured":"Sanders, P.: Massively parallel search for transition-tables of polyautomata. In: Proceedings of the VI International Workshop on Parallel Processing by Cellular Automata and Arrays, (Jesshope, C., Jossifov, V., Wilhelmi, W. (eds.) Akademie, pp. 99\u2013108 (1994)"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0019-9958(85)80033-4","volume":"67","author":"H Szwerinski","year":"1982","unstructured":"Szwerinski, H.: Symmetrical one-dimensional cellular spaces. Inf. Control 67, 163\u2013172 (1982)","journal-title":"Inf. Control"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"3537","DOI":"10.1007\/978-0-387-30440-3_211","volume-title":"Encyclopedia of Complexity and System Science","author":"H Umeo","year":"2009","unstructured":"Umeo, H.: Firing squad synchronization problem in cellular automata. In: Meyers, R.A. (ed.) Encyclopedia of Complexity and System Science, vol. 4, pp. 3537\u20133574. Springer, Heidelberg (2009)"},{"issue":"2","key":"22_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1142\/S0129626409000237","volume":"19","author":"H Umeo","year":"2009","unstructured":"Umeo, H., Kamikawa, N., Yun\u00e8s, J.B.: A family of smallest symmetrical four-state firing squad synchronization protocols for ring arrays. Parallel Process. Lett. 19(2), 299\u2013313 (2009)","journal-title":"Parallel Process. Lett."},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/11861201_21","volume-title":"Cellular Automata","author":"H Umeo","year":"2006","unstructured":"Umeo, H., Maeda, M., Hongyo, K.: A design of symmetrical six-state 3n-step firing squad synchronization algorithms and their implementations. In: El Yacoubi, S., Chopard, B., Bandini, S. (eds.) ACRI 2006. LNCS, vol. 4173, pp. 157\u2013168. Springer, Heidelberg (2006)"},{"issue":"12","key":"22_CR16","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1007\/BF02084165","volume":"21","author":"R Vollmar","year":"1982","unstructured":"Vollmar, R.: Some remarks about the \u201cEfficiency\u201d of polyautomata. Int. J. Theor. Phys. 21(12), 1007\u20131015 (1982)","journal-title":"Int. J. Theor. Phys."},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0019-9958(66)90110-0","volume":"9","author":"A Waksman","year":"1966","unstructured":"Waksman, A.: An optimum solution to the firing squad synchronization problem. Inf. Control 9, 66\u201378 (1966)","journal-title":"Inf. Control"},{"issue":"2","key":"22_CR18","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0304-3975(94)90045-0","volume":"127","author":"J-B Yun\u00e8s","year":"1994","unstructured":"Yun\u00e8s, J.-B.: Seven states solutions to the firing squad synchronization problem. Theor. Comput. Sci. 127(2), 313\u2013332 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"22_CR19","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1051\/ita:2007051","volume":"42","author":"J-B Yun\u00e8s","year":"2008","unstructured":"Yun\u00e8s, J.-B.: An intrinsically non minimal-time Minsky-like 6-states solution to the firing squad synchronization problem. Theor. Inf. Appl. 42(1), 55\u201368 (2008)","journal-title":"Theor. Inf. Appl."},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-74593-8_27","volume-title":"Machines, Computations, and Universality","author":"J-B Yun\u00e8s","year":"2007","unstructured":"Yun\u00e8s, J.-B.: Simple new algorithms which solve the firing squad synchronization problem: a 7-states 4n-steps solution. In: Durand-Lose, J., Margenstern, M. (eds.) MCU 2007. LNCS, vol. 4664, pp. 316\u2013324. Springer, Heidelberg (2007)"},{"issue":"2","key":"22_CR21","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ipl.2008.01.009","volume":"19","author":"JB Yun\u00e8s","year":"2008","unstructured":"Yun\u00e8s, J.B.: A 4-states algebraic solution to linear cellular automata synchronization. Inf. Process. Lett. 19(2), 71\u201375 (2008)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21909-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T13:37:27Z","timestamp":1676468247000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21909-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319219080","9783319219097"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21909-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"25 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}