{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:02:07Z","timestamp":1725483727802},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678236"},{"type":"electronic","value":"9783540449294"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44929-9_17","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:20:53Z","timestamp":1178356853000},"page":"213-225","source":"Crossref","is-referenced-by-count":2,"title":["Real-Time Language Recognition by Alternating Cellular Automata"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Buchholz","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Klein","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Kutrib","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"key":"17_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/BFb0055832","volume-title":"Mathematical Foundations in Computer Science1998","author":"Th. Buchholz","year":"1998","unstructured":"Buchholz, Th., Klein, A., and Kutrib, M. One guess one-way cellular arrays. Mathematical Foundations in Computer Science1998, LNCS 1450, 1998, pp. 807\u2013815."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Buchholz, Th., Klein, A., and Kutrib, M. Real-time language recognition by alternating cellular automata. IFIG Research Report 9904, Institute of Informatics, University of Giessen, 1999.","DOI":"10.1007\/3-540-44929-9_17"},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF00264617","volume":"21","author":"C. Chofirut","year":"1984","unstructured":"Chofirut, C. and \u010culikII, K. On real-time cellular automata and trellis automata. Acta Inf. 21 (1984), 393\u2013407.","journal-title":"Acta Inf."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0019-9958(80)90164-3","volume":"44","author":"C.R. Dyer","year":"1980","unstructured":"Dyer, C.R. One-way bounded cellular automata Inform. Control 44 (1980), 261\u2013281.","journal-title":"Inform. Control"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(88)90040-0","volume":"57","author":"O.H. Ibarra","year":"1988","unstructured":"Ibarra, O.H. and Jiang, T. Relating the power of cellular arrays to their closure properties. Theoret. Comput. Sci. 57 (1988), 225\u2013238.","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0743-7315(85)90034-6","volume":"2","author":"O.H. Ibarra","year":"1985","unstructured":"Ibarra, O.H. and Palis, M. A. Some results concerning linear iterative (systolic) arrays. J. Parallel and Distributed Comput. 2 (1985), 182\u2013218.","journal-title":"J. Parallel and Distributed Comput."},{"key":"17_CR7","unstructured":"Ito, A., Inoue, K., and Wang, Y. Alternating automata characterizations of oneway iterative arrays. International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, 1999, pp. 119\u2013128."},{"key":"17_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-48321-7_26","volume-title":"Fundamentals of Computation Theory1999","author":"C. Iwamoto","year":"1999","unstructured":"Iwamoto, C., Hatsuyama, T., Morita, K., and Imai, K. On time-constructible functions in one-dimensional cellular automata. Fundamentals of Computation Theory1999, LNCS 1684, 1999, pp. 317\u2013326."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-3975(95)80009-3","volume":"143","author":"K. Krithivasan","year":"1995","unstructured":"Krithivasan, K. and Mahajan, M. Nondeterministic, probabilistic and alternating computations on cellular array models. Theoret. Comput. Sci. 143 (1995), 23\u201349.","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0304-3975(96)00214-9","volume":"180","author":"M. Matamala","year":"1997","unstructured":"Matamala, M. Alternation on cellular automata. Theoret. Comput. Sci. 180 (1997), 229\u2013241.","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR11","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. Theoret. Comput. Sci. 50 (1987), 183\u2013238.","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR12","unstructured":"Reischle, F. and Worsch, Th. Simulations between alternating CA, alternating TM and circuit families. Technical Report 9\/98, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, 1998."},{"key":"17_CR13","volume-title":"Technical Report 79-02","author":"S.R. Seidel","year":"1979","unstructured":"Seidel, S.R. Language recognition and the synchronization of cellular automata. Technical Report 79-02, Department of Computer Science, University of Iowa, Iowa City, 1979."},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/S0022-0000(72)80004-7","volume":"6","author":"A.R. Smith III","year":"1972","unstructured":"SmithIII, A.R. Real-time language recognition by one-dimensional cellular automata. J. Comput. System Sci. 6 (1972), 233\u2013253.","journal-title":"J. Comput. System Sci."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/0020-0190(82)90028-X","volume":"14","author":"H. Umeo","year":"1982","unstructured":"Umeo, H., Morita, K., and Sugata, K. Deterministic one-way simulation of two-way real-time cellular automata and its related problems. Inform. Process. Lett 14 (1982), 158\u2013161.","journal-title":"Inform. Process. Lett"},{"key":"17_CR16","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 Inform. Control 9 (1966), 66\u201378.","journal-title":"Inform. Control"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44929-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T15:14:20Z","timestamp":1587482060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44929-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678236","9783540449294"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44929-9_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}