{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:55:01Z","timestamp":1725490501897},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742395"},{"type":"electronic","value":"9783540742401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74240-1_33","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T07:04:18Z","timestamp":1188198258000},"page":"376-387","source":"Crossref","is-referenced-by-count":2,"title":["Real-Time Reversible Iterative Arrays"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(72)80013-8","volume":"6","author":"S. Amoroso","year":"1972","unstructured":"Amoroso, S., Patt, Y.N.: Decision procedures for surjectivity and injectivity of parallel maps for tesselation structures. J. Comput. System Sci.\u00a06, 448\u2013464 (1972)","journal-title":"J. Comput. System Sci."},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1145\/322326.322334","volume":"29","author":"D. Angluin","year":"1982","unstructured":"Angluin, D.: Inference of reversible languages. J. ACM\u00a029, 741\u2013765 (1982)","journal-title":"J. ACM"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"C.H. Bennet","year":"1973","unstructured":"Bennet, C.H.: Logical reversibility of computation. IBM Journal of Research and Development\u00a017, 525\u2013532 (1973)","journal-title":"IBM Journal of Research and Development"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/S0167-8191(97)00075-6","volume":"23","author":"T.. Buchholz","year":"1997","unstructured":"Buchholz, Th., Kutrib, M.: Some relations between massively parallel arrays. Parallel Comput.\u00a023, 1643\u20131662 (1997)","journal-title":"Parallel Comput."},{"key":"33_CR5","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: Words, Languages and Combinatorics III, pp. 73\u201387. World Scientific Publishing, Singapore (2003)"},{"key":"33_CR6","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, Th., 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":"33_CR7","first-page":"349","volume-title":"Real-time computation by n-dimensional iterative arrays of finite-state machines","author":"S.N. Cole","year":"1969","unstructured":"Cole, S.N.: Real-time computation by n-dimensional iterative arrays of finite-state machines, pp. 349\u2013365. IEEE Computer Society Press, Los Alamitos (1969)"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/11523468_34","volume-title":"Automata, Languages and Programming","author":"E. Czeizler","year":"2005","unstructured":"Czeizler, E., Kari, J.: A tight linear bound on the neighborhood of inverse cellular automata. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 410\u2013420. Springer, Heidelberg (2005)"},{"key":"33_CR9","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. ACM\u00a012, 388\u2013394 (1965)","journal-title":"J. ACM"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Hartmanis, J.: Context-free languages and Turing machine computations. In: Proc. Symposia in Applied Mathematics, vol.\u00a019, pp. 42\u201351 (1967)","DOI":"10.1090\/psapm\/019\/0235938"},{"key":"33_CR11","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., Palis, M.A.: Some results concerning linear iterative (systolic) arrays. J. Parallel Distributed Comput.\u00a02, 182\u2013218 (1985)","journal-title":"J. Parallel Distributed Comput."},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/0304-3975(96)00016-3","volume":"165","author":"K. Imai","year":"1996","unstructured":"Imai, K., Morita, K.: Firing squad synchronization problem in reversible cellular automata. Theoret. Comput. Sci.\u00a0165, 475\u2013482 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1016\/S0304-3975(01)00112-8","volume":"270","author":"C. Iwamoto","year":"2002","unstructured":"Iwamoto, C., Hatsuyama, T., Morita, K., Imai, K.: Constructible functions in cellular automata and their applications to hierarchy results. Theoret. Comput. Sci.\u00a0270, 797\u2013809 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80025-X","volume":"48","author":"J. Kari","year":"1994","unstructured":"Kari, J.: Reversibility and surjectivity problems of cellular automata. J. Comput. System Sci.\u00a048, 149\u2013182 (1994)","journal-title":"J. Comput. System Sci."},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.11.021","volume":"334","author":"J. Kari","year":"2005","unstructured":"Kari, J.: Theory of cellular automata: a survey. Theoret. Comput. Sci.\u00a0334, 3\u201333 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR16","first-page":"139","volume-title":"Where Mathematics, Computer Science and Biology Meet","author":"M. Kutrib","year":"2001","unstructured":"Kutrib, M.: Automata arrays and context-free languages. In: Where Mathematics, Computer Science and Biology Meet, pp. 139\u2013148. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"33_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Language and Automata Theory and Applications (LATA 2007)","author":"M. Kutrib","year":"2007","unstructured":"Kutrib, M., Malcher, A.: Fast reversible language recognition using cellular automata. In: Language and Automata Theory and Applications (LATA 2007). LNCS, Springer, Heidelberg ( to appear, 2007)"},{"key":"33_CR18","first-page":"721","volume":"E87-D","author":"A. Malcher","year":"2004","unstructured":"Malcher, A.: On the descriptional complexity of iterative arrays. IEICE Trans. Inf. Syst.\u00a0E87-D, 721\u2013725 (2004)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"33_CR19","first-page":"758","volume":"E72","author":"K. Morita","year":"1989","unstructured":"Morita, K., Harao, M.: Computation universality of one dimensional reversible injective cellular automata. Trans. IEICE\u00a0E72, 758\u2013762 (1989)","journal-title":"Trans. IEICE"},{"key":"33_CR20","first-page":"223","volume":"E72","author":"K. Morita","year":"1989","unstructured":"Morita, K., Shirasaki, A., Gono, Y.: A 1-tape 2-symbol reversible Turing machine. Trans. of the IEICE\u00a0E72, 223\u2013228 (1989)","journal-title":"Trans. of the IEICE"},{"key":"33_CR21","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0020-0190(92)90231-J","volume":"42","author":"K. Morita","year":"1992","unstructured":"Morita, K.: Computation-universality of one-dimensional one-way reversible cellular automata. Inform. Process. Lett.\u00a042, 325\u2013329 (1992)","journal-title":"Inform. Process. Lett."},{"key":"33_CR22","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1142\/S0218001494000280","volume":"8","author":"K. Morita","year":"1994","unstructured":"Morita, K., Ueno, S.: Parallel generation and parsing of array languages using reversible cellular automata. Int. J. Pattern Recog. and Artificial Intelligence\u00a08, 543\u2013561 (1994)","journal-title":"Int. J. Pattern Recog. and Artificial Intelligence"},{"key":"33_CR23","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0304-3975(95)00038-X","volume":"148","author":"K. Morita","year":"1995","unstructured":"Morita, K.: Reversible simulation of one-dimensional irreversible cellular automata. Theoret. Comput. Sci.\u00a0148, 157\u2013163 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR24","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1142\/S0218001499000318","volume":"13","author":"K. Morita","year":"1999","unstructured":"Morita, K., Ueno, S., Imai, K.: Characterizing the ability of parallel array generators on reversible partitioned cellular automata. Int. J. Pattern Recog. and Artificial Intelligence\u00a013, 523\u2013538 (1999)","journal-title":"Int. J. Pattern Recog. and Artificial Intelligence"},{"key":"33_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BFb0023844","volume-title":"LATIN 92","author":"J.E. Pin","year":"1992","unstructured":"Pin, J.E.: On reversible automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol.\u00a0583, pp. 401\u2013416. Springer, Heidelberg (1992)"},{"key":"33_CR26","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0022-0000(77)80007-X","volume":"15","author":"T. Toffoli","year":"1977","unstructured":"Toffoli, T.: Computation and construction universality of reversible cellular automata. J. Comput. System Sci.\u00a015, 213\u2013231 (1977)","journal-title":"J. Comput. System Sci."},{"key":"33_CR27","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":"Smith III, A.R.: Real-time language recognition by one-dimensional cellular automata. J. Comput. System Sci.\u00a06, 233\u2013253 (1972)","journal-title":"J. Comput. System Sci."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74240-1_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:15:19Z","timestamp":1619504119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74240-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540742395","9783540742401"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74240-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}