{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T07:03:14Z","timestamp":1725606194099},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642231773"},{"type":"electronic","value":"9783642231780"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23178-0_19","type":"book-chapter","created":{"date-parts":[[2011,9,10]],"date-time":"2011-09-10T03:15:58Z","timestamp":1315624558000},"page":"210-223","source":"Crossref","is-referenced-by-count":5,"title":["Smallest Implementations of Optimum-Time Firing Squad Synchronization Algorithms for One-Bit-Communication Cellular Automata"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Umeo","sequence":"first","affiliation":[]},{"given":"Takashi","family":"Yanagihara","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_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. Information and Control\u00a010, 22\u201342 (1967)","journal-title":"Information and Control"},{"key":"19_CR2","unstructured":"Beyer, W.T.: Recognition of topological invariants by iterative arrays. Ph.D. Thesis, MIT, p. 144 (1969)"},{"issue":"3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1145\/321281.321290","volume":"12","author":"P.C. Fischer","year":"1965","unstructured":"Fischer, P.C.: Generation of primes by a one-dimensional real-time iterative array. J. of ACM\u00a012(3), 388\u2013394 (1965)","journal-title":"J. of ACM"},{"key":"19_CR4","unstructured":"Gerken, H.D.: \u00dcber Synchronisations - Probleme bei Zellularautomaten. Diplom arbeit,Institut f\u00fcr Theoretische Informatik, Technische Universit\u00e4t Braunschweig, p. 50 (1987)"},{"key":"19_CR5","series-title":"Dittoed course notesfor Applied Mathematics","first-page":"52","volume-title":"A minimal time solution of the firing squad problem","author":"E. Goto","year":"1962","unstructured":"Goto, E.: A minimal time solution of the firing squad problem. Dittoed course notesfor Applied Mathematics, vol.\u00a0298, pp. 52\u201359. Harvard University, Cambridge (1962)"},{"issue":"3","key":"19_CR6","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1142\/S0129054107004875","volume":"18","author":"J. Gruska","year":"2007","unstructured":"Gruska, J., Torre, S.L., Parente, M.: The firing squad synchronization problem on squares, toruses and rings. Intern. J. of Foundations of Computer Science\u00a018(3), 637\u2013654 (2007)","journal-title":"Intern. J. of Foundations of Computer Science"},{"key":"19_CR7","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 synchronizationproblem. Theoretical Computer Science\u00a050, 183\u2013238 (1987)","journal-title":"Theoretical Computer Science"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/S0304-3975(96)00084-9","volume":"168","author":"J. Mazoyer","year":"1996","unstructured":"Mazoyer, J.: On optimal solutions to the firing squad synchronization problem. Theoretical Computer Science\u00a0168, 367\u2013404 (1996)","journal-title":"Theoretical Computer Science"},{"key":"19_CR9","first-page":"28","volume-title":"Computation: Finite and infinite machines","author":"M.L. Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: Finite and infinite machines, pp. 28\u201329. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"19_CR10","first-page":"213","volume-title":"Sequential Machines, Selected Papers","author":"E.F. Moore","year":"1964","unstructured":"Moore, E.F.: The firing squad synchronization problem. In: Moore, E.F. (ed.) Sequential Machines, Selected Papers, pp. 213\u2013214. Addison-Wesley, Reading (1964)"},{"key":"19_CR11","unstructured":"Nishimura, J., Sogabe, T., Umeo, H.: A design of o ptimum-time firing squad synchronizationalgorithm on 1-bit cellular automaton. In: Proc. of the 8th International Symposium on Artificial Life and Robotics, pp. 381\u2013386 (2003)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0019-9958(74)80055-0","volume":"24","author":"I. Shinahr","year":"1974","unstructured":"Shinahr, I.: Two- and three-dimensional firing squad synchronization problems. Information and Control\u00a024, 163\u2013180 (1974)","journal-title":"Information and Control"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/3-540-45132-3_18","volume-title":"Machines, Computations, and Universality","author":"S. Torre La","year":"2001","unstructured":"La Torre, S., Napoli, M., Parente, M.: Firing squad synchronization problem on bidimensional cellular automata with communication constraints. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol.\u00a02055, pp. 264\u2013275. Springer, Heidelberg (2001)"},{"key":"19_CR14","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.\u00a04, pp. 3537\u20133574. Springer, Heidelberg (2009)"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-12203-3_6","volume-title":"Simulating Complex Systems by Cellular Automata","author":"H. Umeo","year":"2010","unstructured":"Umeo, H.: Problem solving on one-bit-communication cellular automata. In: Hoekstra, A.G., Kroc, J., Sloot, P.M.A. (eds.) Simulating Complex Systems by Cellular Automata, ch. 6, pp. 117\u2013144. Springer, Heidelberg (2010)"},{"key":"19_CR16","first-page":"403","volume":"1","author":"H. Umeo","year":"2005","unstructured":"Umeo, H., Hisaoka, M., Sogabe, T.: A survey on optimum-time firing squad synchronization algorithms for one-dimensional cellular automata. Intern. J. of Unconventional Computing\u00a01, 403\u2013426 (2005)","journal-title":"Intern. J. of Unconventional Computing"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/3-540-45830-1_7","volume-title":"Cellular Automata","author":"H. Umeo","year":"2002","unstructured":"Umeo, H., Maeda, M., Fujiwara, N.: An efficient mapping scheme for embeddingany one-dimensional firing squad synchronization algorithm onto two-dimensional arrays. In: Bandini, S., Chopard, B., Tomassini, M. (eds.) ACRI 2002. LNCS, vol.\u00a02493, pp. 69\u201381. Springer, Heidelberg (2002)"},{"key":"19_CR18","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.\u00a04173, pp. 157\u2013168. Springer, Heidelberg (2006)"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-15979-4_24","volume-title":"Cellular Automata","author":"H. Umeo","year":"2010","unstructured":"Umeo, H., Kubo, K.: A seven-state time-optimum square synchronizer. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds.) ACRI 2010. LNCS, vol.\u00a06350, pp. 219\u2013230. Springer, Heidelberg (2010)"},{"issue":"4","key":"19_CR20","first-page":"603","volume":"74","author":"H. Umeo","year":"2006","unstructured":"Umeo, H., Maeda, M., Hisaoka, M., Teraoka, M.: A state -efficient mapping schemefor designing two-dimensional firing squad synchronization algorithms. Fundamenta Informaticae\u00a074(4), 603\u2013623 (2006)","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"19_CR21","first-page":"449","volume":"78","author":"H. Umeo","year":"2007","unstructured":"Umeo, H., Michisaka, K., Kamikawa, N., Kanazawa, M.: State-efficient one-bit communication solutions for some classical cellular automata problems. Fundamenta Informaticae\u00a078(3), 449\u2013465 (2007)","journal-title":"Fundamenta Informaticae"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/11861201_22","volume-title":"Cellular Automata","author":"H. Umeo","year":"2006","unstructured":"Umeo, H., Yanagihara, T., Kanazawa, M.: State-efficient firing squad synchronization protocols for communication-restricted cellular automata. In: El Yacoubi, S., Chopard, B., Bandini, S. (eds.) ACRI 2006. LNCS, vol.\u00a04173, pp. 169\u2013181. Springer, Heidelberg (2006)"},{"key":"19_CR23","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. Information and Control\u00a09, 66\u201378 (1966)","journal-title":"Information and Control"},{"key":"19_CR24","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-state solution to the firing squad synchronization problem. Theoretical Computer Science\u00a0127, 313\u2013332 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"19_CR25","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. Theoretical Informatics and Applications\u00a042(1), 55\u201368 (2008)","journal-title":"Theoretical Informatics and Applications"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23178-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T02:27:13Z","timestamp":1554258433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23178-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642231773","9783642231780"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23178-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}