{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:01:08Z","timestamp":1725494468376},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405238"},{"type":"electronic","value":"9783540376194"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-37619-4_18","type":"book-chapter","created":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T18:51:13Z","timestamp":1194375073000},"page":"165-178","source":"Crossref","is-referenced-by-count":0,"title":["A Comparative Investigation into Optimum-Time Synchronization Protocols for a Large Scale of One-Dimensional Cellular Automata"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Umeo","sequence":"first","affiliation":[]},{"given":"Masaya","family":"Hisaoka","sequence":"additional","affiliation":[]},{"given":"Takashi","family":"Sogabe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/S0019-9958(67)90032-0","volume":"10","author":"R. Balzer","year":"1967","unstructured":"R. Balzer: An 8-state minimal time solution to the firing squad synchronization problem. Information and Control, vol. 10 (1967), pp. 22\u201342.","journal-title":"Information and Control"},{"key":"18_CR2","unstructured":"Hans-D., Gerken: \u00dcber Synchronisations-Probleme bei Zellularautomaten. Diplomarbeit, Institut f\u00fcr Theoretische Informatik, Technische Universit\u00e4t Braunschweig, (1987), pp. 50."},{"key":"18_CR3","first-page":"52","volume":"298","author":"E. Goto","year":"1962","unstructured":"E. Goto: A minimal time solution of the firing squad problem. Dittoed course notes for Applied Mathematics 298, Harvard University, (1962), pp. 52\u201359, with an illustration in color.","journal-title":"Dittoed course notes for Applied Mathematics"},{"key":"18_CR4","unstructured":"E. Goto: Some puzzles on automata. in Toward computer sciences (T. Kitagawa ed.), Kyouritsu, (1966), pp. 67\u201391."},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/3-540-19444-4_16","volume":"316","author":"J. Mazoyer","year":"1986","unstructured":"J. Mazoyer: An overview of the firing squad synchronization problem. Lecture Notes on Computer Science, Springer-Verlag, vol. 316 (1986), pp. 82\u201393.","journal-title":"Lecture Notes on Computer Science"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(87)90124-1","volume":"50","author":"J. Mazoyer","year":"1987","unstructured":"J. Mazoyer: A six-state minimal time solution to the firing squad synchronization problem. Theoretical Computer Science, vol. 50 (1987), pp. 183\u2013238.","journal-title":"Theoretical Computer Science"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/S0304-3975(96)00084-9","volume":"168","author":"J. Mazoyer","year":"1996","unstructured":"J. Mazoyer: On optimal solutions to the firing squad synchronization problem. Theoretical Computer Science, vol. 168 (1996), pp. 367\u2013404.","journal-title":"Theoretical Computer Science"},{"key":"18_CR8","unstructured":"J. Mazoyer: A minimal-time solution to the FSSP without recursive call to itself and with bounded slope of signals. Draft version, (1997), pp. 8."},{"key":"18_CR9","unstructured":"M. Minsky: Computation: Finite and infinite machines. Prentice Hall, (1967), pp. 28\u201329."},{"key":"18_CR10","first-page":"213","volume-title":"Sequential Machines, Selected Papers","author":"E. F. Moore","year":"1964","unstructured":"E. F. Moore: The firing squad synchronization problem. in Sequential Machines, Selected Papers (E. F. Moore, ed.), Addison-Wesley, Reading MA., (1964), pp. 213\u2013214."},{"key":"18_CR11","first-page":"381","volume":"2","author":"J. Nishimura","year":"2003","unstructured":"J. Nishimura, T. Sogabe and H. Umeo: A design of optimum-time firing squad synchronization algorithm on 1-bit cellular automaton. Proc. of the 8th International Symposium on Artificial Life and Robotics, Vol.2 (2003), pp. 381\u2013386.","journal-title":"Proc. of the 8th International Symposium on Artificial Life and Robotics"},{"key":"18_CR12","unstructured":"H. Umeo: A note on firing squad synchronization algorithms-A reconstruction of Goto\u2019s first-in-the-world optimum-time firing squad synchronization algorithm. Proc. of Cellular Automata Workshop, M. Kutrib and T. Worsch (eds.), (1996), pp. 65."},{"key":"18_CR13","first-page":"257","volume":"52","author":"H. Umeo","year":"2002","unstructured":"H. Umeo and N. Kamikawa: A design of real-time non-regular sequence generation algorithms and their implementations on cellular automata with 1-bit inter-cell communications. Fundamenta Informaticae, 52 (2002), pp. 257\u2013275.","journal-title":"Fundamenta Informaticae"},{"issue":"4","key":"18_CR14","first-page":"433","volume":"1A","author":"H. Umeo","year":"2000","unstructured":"H. Umeo, J. Nishimura and T. Sogabe: 1-bit inter-cell communication cellular algorithms (invited lecture). Proc. of the Tenth Intern. Colloquium on Differential Equations, held in Plovdiv in 1999, International Journal of Differential Equations and Applications, vol. 1A, no. 4 (2000), pp. 433\u2013446.","journal-title":"International Journal of Differential Equations and Applications"},{"key":"18_CR15","unstructured":"H. Umeo, T. Sogabe and Y. Nomura: Correction, optimization and verification of transition rule set for Waksman\u2019s firing squad synchronization algorithm. Proc. of the Fourth Intern. Conference on Cellular Automata for Research and Industry, Springer, (2000), pp. 152\u2013160."},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"R. Vollmar: Algorithmen in Zellularautomaten. Teubner, (1979), pp. 192.","DOI":"10.1007\/978-3-322-96671-1"},{"issue":"12","key":"18_CR17","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1007\/BF02084165","volume":"21","author":"R. Vollmar","year":"1982","unstructured":"R. Vollmar: Some remarks about the \u201cEfficiency\u201d of polyautomata. International Journal of Theoretical Physics, vol. 21, no. 12 (1982), pp. 1007\u20131015.","journal-title":"International Journal of Theoretical Physics"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0019-9958(66)90110-0","volume":"9","author":"A. Waksman","year":"1966","unstructured":"A. Waksman: An optimum solution to the firing squad synchronization problem. Information and Control, vol. 9 (1966), pp. 66\u201378.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Processing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-37619-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T20:09:30Z","timestamp":1551038970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-37619-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405238","9783540376194"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-37619-4_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}