{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:57:01Z","timestamp":1725469021430},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540377917"},{"type":"electronic","value":"9783540377931"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11821069_55","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T10:25:12Z","timestamp":1156501512000},"page":"634-645","source":"Crossref","is-referenced-by-count":7,"title":["Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"55_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/3-540-48321-7_13","volume-title":"Fundamentals of Computation Theory","author":"T. Buchholz","year":"1999","unstructured":"Buchholz, T., Klein, A., Kutrib, M.: Iterative arrays with a wee bit alternation. In: Ciobanu, G., P\u0103un, G. (eds.) FCT 1999. LNCS, vol.\u00a01684, pp. 173\u2013184. Springer, Heidelberg (1999)"},{"key":"55_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44612-5_20","volume-title":"Mathematical Foundations of Computer Science 2000","author":"T. Buchholz","year":"2000","unstructured":"Buchholz, T., Klein, A., Kutrib, M.: Iterative arrays with small time bounds. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 243\u2013252. Springer, Heidelberg (2000)"},{"key":"55_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1142\/9789812704979_0006","volume-title":"Words, Languages and Combinatorics III","author":"T. Buchholz","year":"2003","unstructured":"Buchholz, T., Klein, A., Kutrib, M.: Iterative arrays with limited nondeterministic communication cell. In: Ito, M., Imaoka, T. (eds.) Words, Languages and Combinatorics III, pp. 73\u201387. World Scientific Publishing, Singapore (2003)"},{"key":"55_CR4","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/TC.1987.5009449","volume":"C-36","author":"J.H. Chang","year":"1987","unstructured":"Chang, J.H., Ibarra, O.H., Palis, M.A.: Parallel parsing on a one-way array of finite-state machines. IEEE Transactions Computers\u00a0C-36, 64\u201375 (1987)","journal-title":"IEEE Transactions Computers"},{"key":"55_CR5","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/T-C.1969.222663","volume":"C-18","author":"S.N. Cole","year":"1969","unstructured":"Cole, S.N.: Real-time computation by n-dimensional iterative arrays of finite-state machines. IEEE Transactions Computers\u00a0C-18, 349\u2013365 (1969)","journal-title":"IEEE Transactions Computers"},{"key":"55_CR6","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. Journal of the ACM\u00a012, 388\u2013394 (1965)","journal-title":"Journal of the ACM"},{"key":"55_CR7","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O.H. Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. Journal of the ACM\u00a025, 116\u2013133 (1978)","journal-title":"Journal of the ACM"},{"key":"55_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-48321-7_26","volume-title":"Fundamentals of Computation Theory","author":"C. Iwamoto","year":"1999","unstructured":"Iwamoto, C., Hatsuyama, T., Morita, K., Imai, K.: On time-constructible functions in one-dimensional cellular automata. In: Ciobanu, G., P\u0103un, G. (eds.) FCT 1999. LNCS, vol.\u00a01684, pp. 316\u2013326. Springer, Heidelberg (1999)"},{"key":"55_CR9","doi-asserted-by":"crossref","unstructured":"Kutrib, M., Malcher, A.: Fast cellular automata with restricted inter-cell communication: computational capacity. In: Proceedings of IFIP TCS 2006, Santiago de Chile (to appear)","DOI":"10.1007\/978-0-387-34735-6_15"},{"key":"55_CR10","first-page":"721","volume":"E87-D","author":"A. Malcher","year":"2004","unstructured":"Malcher, A.: On the descriptional complexity of iterative arrays. IEICE Transactions on Information Sciences\u00a0E87-D, 721\u2013725 (2004)","journal-title":"IEICE Transactions on Information Sciences"},{"key":"55_CR11","unstructured":"Seidel, S.R.: Language recognition and the synchronization of cellular automata. Technical Report 79-02, University of Iowa (1979)"},{"key":"55_CR12","first-page":"257","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, 257\u2013275 (2002)","journal-title":"Fundamenta Informaticae"},{"key":"55_CR13","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":"55_CR14","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","Mathematical Foundations of Computer Science 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11821069_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:30:44Z","timestamp":1619508644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11821069_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377917","9783540377931"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11821069_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}