{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T08:56:19Z","timestamp":1754556979875},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_39","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T01:32:38Z","timestamp":1188351158000},"page":"439-450","source":"Crossref","is-referenced-by-count":1,"title":["A Time Hierarchy for Bounded One-Way Cellular Automata"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Klein","sequence":"first","affiliation":[]},{"given":"Martin","family":"Kutrib","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"39_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/BFb0055832","volume-title":"Mathematical Foundations of Computer Science","author":"Th. Buchholz","year":"1998","unstructured":"Buchholz, Th., Klein, A., and Kutrib, M. One guess one-way cellular arrays. Mathematical Foundations of Computer Science 1998, LNCS 450, 1998, pp. 807\u2013815."},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Buchholz, Th., Klein, A., and Kutrib, M. On tally languages and generalized interacting automata. Developments in Language Theory IV. Foundations, Applications, and Perspectives, 2000, pp. 316\u2013325.","DOI":"10.1142\/9789812792464_0026"},{"key":"39_CR3","unstructured":"Buchholz, Th., Klein, A., and Kutrib, M. On interacting automata with limited nondeterminism. Fund. Inform. (2001), to appear."},{"key":"39_CR4","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF00264617","volume":"21","author":"C. Choffrut","year":"1984","unstructured":"Choffrut, C. and \u010culikII, K. On real-time cellular automata and trellis automata. Acta Inf. 21 (1984), 393\u2013407.","journal-title":"Acta Inf."},{"key":"39_CR5","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":"39_CR6","doi-asserted-by":"crossref","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. Assoc. Comput. Mach. 12 (1965), 388\u2013394.","journal-title":"Assoc. Comput. Mach."},{"key":"39_CR7","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":"Parallel and Distributed Comput."},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0304-3975(98)00150-9","volume":"217","author":"J. Mazoyer","year":"1999","unstructured":"Mazoyer, J. and Terrier, V. Signals in one dimensional cellular automata. Theoret. Comput. Sci. 217 (1999), 53\u201380.","journal-title":"Theoret. Comput. Sci."},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0304-3975(94)00212-2","volume":"141","author":"V. Terrier","year":"1995","unstructured":"Terrier, V. On real time one-way cellular array. Theoret. Comput. Sci. 141 (1995), 331\u2013335.","journal-title":"Theoret. Comput. Sci."},{"key":"39_CR10","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0304-3975(95)00111-5","volume":"156","author":"V. Terrier","year":"1996","unstructured":"Terrier, V. Language not recognizable in real time by one-way cellular automata. Theoret. Comput. Sci. 156 (1996), 281\u2013287.","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T07:04:13Z","timestamp":1547881453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_39","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}