{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:20:51Z","timestamp":1757312451218},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626169"},{"type":"electronic","value":"9783540683421"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0023479","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:06:33Z","timestamp":1132383993000},"page":"439-450","source":"Crossref","is-referenced-by-count":19,"title":["Intrinsic universality of a 1-dimensional reversible Cellular Automaton"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00f4me Olivier","family":"Durand-Lose","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(72)80013-8","volume":"6","author":"S. Amoroso","year":"1972","unstructured":"S. Amoroso and Y. Patt. Decision procedure for surjectivity and injectivity of parallel maps for tessellation structure. Journal of Computer and System Sciences, 6:448\u2013464, 1972.","journal-title":"Journal of Computer and System Sciences"},{"key":"36_CR2","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"6","author":"C. H. Bennett","year":"1973","unstructured":"C. H. Bennett. Logical reversibility of computation. IBM Journal of Research and Development, 6:525\u2013532, 1973.","journal-title":"IBM Journal of Research and Development"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"J. O. Durand-Lose. Reversible cellular automaton able to simulate any other reversible one using partitioning automata. In latin '95, number 911 in Lecture Notes in Computer Science, pages 230\u2013244. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59175-3_92"},{"key":"36_CR4","unstructured":"J. O. Durand-Lose. Automates Cellulaires, Automates \u00e0 Partitions et Tas de Sable. PhD thesis, labri, 1996. In French."},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BF01691062","volume":"3","author":"G. A. Hedlung","year":"1969","unstructured":"G. A. Hedlung. Endomorphism and automorphism of the shift dynamical system. Mathematical System Theory, 3:320\u2013375, 1969.","journal-title":"Mathematical System Theory"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/0167-2789(90)90195-U","volume":"45","author":"J. Kari","year":"1990","unstructured":"J. Kari. Reversibility of 2D cellular automata is undecidable. Physica D, 45:379\u2013385, 1990.","journal-title":"Physica D"},{"issue":"1","key":"36_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80025-X","volume":"48","author":"J. Kari","year":"1994","unstructured":"J. Kari. Reversibility and surjectivity problems of cellular automata. Journal of Computer and System Sciences, 48(1):149\u2013182, 1994.","journal-title":"Journal of Computer and System Sciences"},{"key":"36_CR8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF01201813","volume":"29","author":"J. Kari","year":"1996","unstructured":"J. Kari. Representation of reversible cellular automata with block permutations. Mathematical System Theory, 29:47\u201361, 1996.","journal-title":"Mathematical System Theory"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0167-2789(84)90252-5","volume":"10","author":"N. Margolus","year":"1984","unstructured":"N. Margolus. Physics-like models of computation. Physica D, 10:81\u201395, 1984.","journal-title":"Physica D"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(92)00076-4","volume":"123","author":"B. Martin","year":"1994","unstructured":"B. Martin. A universal cellular automaton in quasi-linear time and its S-n-m form. Theoretical Computer Science, 123:199\u2013237, 1994.","journal-title":"Theoretical Computer Science"},{"key":"36_CR11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1090\/psapm\/014\/9961","volume":"14","author":"E. Moore","year":"1962","unstructured":"E. Moore. Machine models of self-reproduction. In Proceeding of Symposium on Applied Mathematics, volume 14, pages 17\u201333, 1962.","journal-title":"Proceeding of Symposium on Applied Mathematics"},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0020-0190(92)90231-J","volume":"42","author":"K. Morita","year":"1992","unstructured":"K. Morita. Computation-universality of one-dimensional one-way reversible cellular automata. Information Processing Letters, 42:325\u2013329, 1992.","journal-title":"Information Processing Letters"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0304-3975(95)00038-X","volume":"148","author":"K. Morita","year":"1995","unstructured":"K. Morita. Reversible simulation of one-dimensional irreversible cellular automata. Theoretical Computer Science, 148:157\u2013163, 1995.","journal-title":"Theoretical Computer Science"},{"key":"36_CR14","first-page":"685","volume":"number 14","author":"J. Myhill","year":"1963","unstructured":"J. Myhill. The converse of Moore's garden-of-eden theorem. In Proceedings of the Symposium of Applied Mathematics, number 14, pages 685\u2013686, 1963.","journal-title":"Proceedings of the Symposium of Applied Mathematics"},{"key":"36_CR15","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/S0022-0000(72)80009-6","volume":"6","author":"D. Richardson","year":"1972","unstructured":"D. Richardson. Tessellations with local transformations. Journal of Computer and System Sciences, 6:373\u2013388, 1972.","journal-title":"Journal of Computer and System Sciences"},{"key":"36_CR16","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0022-0000(77)80007-X","volume":"15","author":"T. Toffoli","year":"1977","unstructured":"T. Toffoli. Computation and construction universality of reversible cellular automata. Journal of Computer and System Sciences, 15:213\u2013231, 1977.","journal-title":"Journal of Computer and System Sciences"},{"key":"36_CR17","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1763.001.0001","volume-title":"Cellular Automata Machine \u2014 A New Environment for Modeling","author":"T. Toffoli","year":"1987","unstructured":"T. Toffoli and N. Margolus. Cellular Automata Machine \u2014 A New Environment for Modeling. MIT press, Cambridge, MA, 1987."},{"key":"36_CR18","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0167-2789(90)90185-R","volume":"45","author":"T. Toffoli","year":"1990","unstructured":"T. Toffoli and N. Margolus. Invertible cellular automata: A review. Physica D, 45:229\u2013253, 1990.","journal-title":"Physica D"}],"container-title":["Lecture Notes in Computer Science","STACS 97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023479","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:31:45Z","timestamp":1586568705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023479"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626169","9783540683421"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0023479","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}