{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:45:41Z","timestamp":1725471941444},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540409298"},{"type":"electronic","value":"9783540409328"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11861201_22","type":"book-chapter","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T02:00:39Z","timestamp":1161136839000},"page":"169-181","source":"Crossref","is-referenced-by-count":2,"title":["State-Efficient Firing Squad Synchronization Protocols for Communication-Restricted Cellular Automata"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Umeo","sequence":"first","affiliation":[]},{"given":"Takashi","family":"Yanagihara","sequence":"additional","affiliation":[]},{"given":"Masaru","family":"Kanazawa","sequence":"additional","affiliation":[]}],"member":"297","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. Information and Control\u00a010, 22\u201342 (1967)","journal-title":"Information and Control"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.tcs.2004.01.036","volume":"320","author":"A. Berthiaume","year":"2004","unstructured":"Berthiaume, A., Bittner, T., Perkovi\u0107, L., Settle, A., Simon, J.: Bounding the firing synchronization problem on a ring. Theoretical Computer Science\u00a0320, 213\u2013228 (2004)","journal-title":"Theoretical Computer Science"},{"key":"22_CR3","unstructured":"Hans-D., Gerken: \u00dcber Synchronisations - Probleme bei Zellularautomaten. Diplomarbeit, Institut f\u00fcr Theoretische Informatik, Technische Universit\u00e4t Braunschweig, p. 50 (1987)"},{"key":"22_CR4","unstructured":"Goto, E.: A minimal time solution of the firing squad problem. In: Dittoed course notes for Applied Mathematics 298, pp. 52\u201359 (1962)"},{"key":"22_CR5","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. Theoretical Computer Science\u00a050, 183\u2013238 (1987)","journal-title":"Theoretical Computer Science"},{"key":"22_CR6","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":"22_CR7","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, Englewood Cliffs (1967)"},{"key":"22_CR8","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":"22_CR9","unstructured":"Nishimura, J., Sogabe, T., Umeo, H.: A design of optimum-time firing squad synchronization algorithm on 1-bit cellular automaton. In: Proc. of the 8th International Symposium on Artificial Life and Robotics, vol.\u00a02, pp. 381\u2013386 (2003)"},{"key":"22_CR10","unstructured":"Nishimura, J., Umeo, H.: An Optimum-Time Synchronization Protocol for 1-Bit-Communication Cellular Automata. In: Proc. of The 9th World Multi-Conference on Systemics, Cybernetics and Informatics (2005)"},{"key":"22_CR11","unstructured":"Sanders, P.: Massively parallel search for transition-tables of polyautomata. In: Jesshope, C., Jossifov, V., Wilhelmi, W. (eds.) Proc. of the VI International Workshop on Parallel Processing by Cellular Automata and Arrays, pp. 99\u2013108. Akademi (1994)"},{"key":"22_CR12","unstructured":"Settle, A., Simon, J.: Improved bounds for the firing synchronization problem. In: SIROCCO 5: Proc. of the 5th International Colloquium on Structural Information and Communication Complexity, pp. 66\u201381. Carleton Scientific (1998)"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0304-3975(01)00191-8","volume":"276","author":"A. Settle","year":"2002","unstructured":"Settle, A., Simon, J.: Smaller solutions for the firing squad. Theoretical Computer Science\u00a0276, 83\u2013109 (2002)","journal-title":"Theoretical Computer Science"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1051\/ita:2000130","volume":"34","author":"S.L. Torre","year":"2000","unstructured":"Torre, S.L., Napoli, M., Parente, M.: A compositional approach to synchronize two dimensional networks of processors. Theoretical Informatics and Applications\u00a034, 549\u2013564 (2000)","journal-title":"Theoretical Informatics and Applications"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/S0167-8191(00)00079-X","volume":"27","author":"H. Umeo","year":"2001","unstructured":"Umeo, H.: Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton. Parallel Computing\u00a027, 587\u2013599 (2001)","journal-title":"Parallel Computing"},{"key":"22_CR16","first-page":"255","volume":"52","author":"H. Umeo","year":"2002","unstructured":"Umeo, H., Kamikawa, N.: A design of real-time non-regular sequence generation algorithms and their implementations on cellular automata with 1-bit inter-cell communications. Fundamenta Informaticae\u00a052, 255\u2013275 (2002)","journal-title":"Fundamenta Informaticae"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/3-540-44860-8_51","volume-title":"Computational Science \u2013 ICCS 2003","author":"H. Umeo","year":"2003","unstructured":"Umeo, H., Michisaka, K., Kamikawa, N.: A synchronization problem on 1-bit-communication cellular automata. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol.\u00a02657, pp. 492\u2013500. Springer, Heidelberg (2003)"},{"key":"22_CR18","first-page":"421","volume":"58","author":"H. Umeo","year":"2003","unstructured":"Umeo, H., Kamikawa, N.: Real-time Generation of Primes by a 1-Bit-Communication Cellular Automaton. Fundamenta Informaticae\u00a058, 421\u2013435 (2003)","journal-title":"Fundamenta Informaticae"},{"key":"22_CR19","unstructured":"Umeo, H., Kanazawa, M., Michisaka, K., Kamikawa, N.: State-Efficient 1-Bit-Communication Solutions for Some Classical Cellular Automata Problems. In: Margenstern, M. (ed.) Proc. of the International Workshop on Tilings and Cellular Automata, pp. 1\u201312 (2004)"},{"key":"22_CR20","first-page":"403","volume":"1","author":"H. Umeo","year":"2005","unstructured":"Umeo, H., Hisaoka, M., Sogabe, T.: A Survey on Firing Squad Synchronization Algorithms for One-Dimensional Cellular Automata. International Journal of Unconventional Computing\u00a01, 403\u2013426 (2005)","journal-title":"International Journal of Unconventional Computing"},{"issue":"1981","key":"22_CR21","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/978-3-7091-8596-4_13","volume":"3","author":"R. Vollmar","year":"1981","unstructured":"Vollmar, R.: On Cellular Automata with a Finite Number of State Change. Computing, Supplementum\u00a03(1981), 181\u2013191 (1981)","journal-title":"Computing, Supplementum"},{"issue":"12","key":"22_CR22","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 Efficiency of polyautomata. International Journal of Theoretical Physics\u00a021(12), 1007\u20131015 (1982)","journal-title":"International Journal of Theoretical Physics"},{"key":"22_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":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/10719839_41","volume-title":"LATIN 2000: Theoretical Informatics","author":"T. Worsch","year":"2000","unstructured":"Worsch, T.: Linear time language recognition on cellular automata with restricted communication. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol.\u00a01776, pp. 417\u2013426. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Cellular Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11861201_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T22:55:46Z","timestamp":1553295346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11861201_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540409298","9783540409328"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11861201_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}