{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:18:39Z","timestamp":1725596319963},"publisher-location":"London","reference-count":31,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781852335403"},{"type":"electronic","value":"9781447101291"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/978-1-4471-0129-1_6","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T14:11:06Z","timestamp":1310998266000},"page":"135-160","source":"Crossref","is-referenced-by-count":10,"title":["Computing Inside the Billiard Ball Model"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00f4me","family":"Durand-Lose","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","first-page":"1","volume":"1","author":"J Albert","year":"1987","unstructured":"Albert J. and Culik II K. A simple universal cellular automaton and its one-way and totalistic versionComplex Systems 1 (1987) 1\u201316","journal-title":"Complex Systems"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"6","author":"CH Bennett","year":"1973","unstructured":"Bennett C.H. Logical reversibility of computation IBM Journal of Research and Development 6 (1973) 525\u2013532","journal-title":"IBM Journal of Research and Development"},{"key":"6_CR3","volume-title":"Essays on Cellular Automata","author":"A Burks","year":"1970","unstructured":"Burks AEssays on Cellular Automata(Univ. of Illinois Press, 1970)."},{"key":"6_CR4","first-page":"230","volume-title":"LATIN \u201995Lecture Notes in Computer Sciences 911","author":"J Durand-Lose","year":"1995","unstructured":"Durand-Lose J. Reversible cellular automaton able to simulate any other reversible one using partitioning automata, In: R. Baeza-Yates and E. Goles and P. Poblete (Eds.), LATIN \u201995, Lecture Notes in Computer Sciences 911 (1995) 230\u2013244"},{"key":"6_CR5","first-page":"439","volume-title":"STAGS \u201997Lecture Notes in Computer Sciences 1200","author":"J Durand-Lose","year":"1997","unstructured":"Durand-Lose J. Intrinsic universality of a 1-dimensional reversible cellular automaton, In: R. Reischuk and M. Morvan (Eds.), STAGS \u201997, Lecture Notes in Computer Sciences 1200 (1997) 439\u2013450."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0304-3975(99)00075-4","volume":"246","author":"J Durand-Lose","year":"2000","unstructured":"Durand-Lose J. Reversible space-time simulation of cellular automata Theoretical Computer Science 246 (2000) 117\u2013129","journal-title":"Theoretical Computer Science"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Durand-Lose J. Representing reversible cellular automata with reversible block cellular automata In: R. Cori, J. Mazoyer, M. Morvan, and R. Mosery (Eds.) Discrete models, combinatorics, computation and geometry (DM-CCG\u201901), volume AA. Discrete Mathematics and Theoretical Computer Science, 2001","DOI":"10.46298\/dmtcs.2297"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01857727","volume":"21","author":"E Fredkin","year":"1982","unstructured":"Fredkin E. and Toffoli T. Conservative logic International Journal of Theoretical Physics 21 (1982) 219\u2013253","journal-title":"International Journal of Theoretical Physics"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BF01691062","volume":"3","author":"GA Hedlund","year":"1969","unstructured":"Hedlund G.A. Endomorphism and automorphism of the shift dynamical system Mathematical System Theory 3 (1969) 320\u2013375","journal-title":"Mathematical System Theory"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/0167-2789(90)90195-U","volume":"45","author":"J Kari","year":"1990","unstructured":"Kari J. Reversibility of 2D cellular automata is undecidable Physica D 45 (1990) 379\u2013385","journal-title":"Physica D"},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF01201813","volume":"29","author":"J Kari","year":"1996","unstructured":"Kari J. Representation of reversible cellular automata with block permutations Mathematical System Theory 29 (1996) 47\u201361","journal-title":"Mathematical System Theory"},{"key":"6_CR12","first-page":"2597","volume":"257","author":"Y Lecerf","year":"1963","unstructured":"Lecerf Y. Machines de Turing r\u00a8\u00a6versibles. R\u00a8\u00a6cursive insolubilit\u00a8\u00a6 en n E IN de l\u2019\u00a8\u00a6quation u = 6r ou O est un \u201cisomorphism de codes\u201d Comptes Rendus de L\u2019Academie Francaise des Sciences 257 (1963) 2597\u20132600","journal-title":"E IN de l\u2019\u00a8\u00a6quation u = 6r ou O est un \u201cisomorphism de codes\u201d Comptes Rendus de L\u2019Academie Francaise des Sciences"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0167-2789(84)90252-5","volume":"10","author":"N Margolus","year":"1984","unstructured":"Margolus N. Physics-like models of computation Physica D 10 (1984) 81\u201395","journal-title":"Physica D"},{"key":"6_CR14","volume-title":"Finite and Infinite Machines","author":"M Minsky","year":"1967","unstructured":"Minsky M. Finite and Infinite Machines (Prentice Hall, 1967)."},{"key":"6_CR15","first-page":"758","volume":"E 72","author":"K Morita","year":"1989","unstructured":"Morita K. and Harao M. Computation universality of one-dimensional reversible (injective) cellular automata Transactions of the IEICE E 72 (1989) 758\u2013762","journal-title":"Transactions of the IEICE"},{"key":"6_CR16","first-page":"978","volume":"E 73","author":"K Morita","year":"1990","unstructured":"Morita K. A simple construction method of a reversible finite automaton out of Fredkin gates, and its related problem Transactions of the IEICE E 73 (1990) 978\u2013984","journal-title":"Transactions of the IEICE"},{"key":"6_CR17","first-page":"55","volume":"92-45","author":"K Morita","year":"1992","unstructured":"Morita K. Any irreversible cellular automaton can be simulated by a reversible one having the same dimension (on finite configurations) Technical Report of the IEICE, Comp. 92\u201345 (1992) 55\u201364","journal-title":"Technical Report of the IEICE, Comp"},{"key":"6_CR18","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 Information Processing Letters 42 (1992) 325\u2013329","journal-title":"Information Processing Letters"},{"key":"6_CR19","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 Theoretical Computer Science 148 (1995) 157\u2013163","journal-title":"Theoretical Computer Science"},{"key":"6_CR20","first-page":"141","volume":"E75-D","author":"K Morita","year":"1992","unstructured":"Morita K.. and Ueno S. Computation-universal models of two-dimensional 16-state reversible automata IEICE Transactions on Informations and Systems E75-D (1992) 141\u2013147","journal-title":"Transactions on Informations and Systems"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-56346-6_40","volume":"654","author":"K Morita","year":"1992","unstructured":"Morita K. and Ueno S. Parallel generation and parsing of array languages using reversible cellular automata Lecture Notes in Computer Science 654 (1992) 213\u2013230","journal-title":"Lecture Notes in Computer Science"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/S0022-0000(72)80009-6","volume":"6","author":"D Richardson","year":"1972","unstructured":"Richardson D. Tessellations with local transformations Journal of Computer and System Sciences 6 (1972) 373\u2013388","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR23","unstructured":"Rogozhin Yu.V. Seven universal Turing machines In Systems and Theoretical Programming, number 63, Matematicheskije Issledovanija (Academia Nauk Moldayskoi SSR) (1992) 76\u201390; in Russian"},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0304-3975(96)00077-1","volume":"168","author":"YV Rogozhin","year":"1996","unstructured":"Rogozhin Yu.V. Small universal Turing machines Theoretical Computer Science 168 (1996) 215\u2013240","journal-title":"Theoretical Computer Science"},{"key":"6_CR25","volume-title":"Introduction to the Theory of Computation (PWS Publishing Co.","author":"M Sipser","year":"1997","unstructured":"Sipser M. Introduction to the Theory of Computation (PWS Publishing Co., Boston, Massachusetts, 1997)"},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/321650.321652","volume":"18","author":"AR Smith III","year":"1971","unstructured":"Smith III A.R. Simple computation-universal cellular spaces Journal of the Association for Computing Machinery 18 (1971) 339\u2013353","journal-title":"Journal of the Association for Computing Machinery"},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1006\/jcss.1995.1009","volume":"50","author":"K Sutner","year":"1995","unstructured":"Sutner K. On the complexity of finite cellular automata Journal of Computer and System Sciences 50 (1995) 87\u201397","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR28","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1763.001.0001","volume-title":"Cellular Automata Machine A New Environment for Modeling (MIT Press","author":"T Toffoli","year":"1987","unstructured":"Toffoli T. and Margolus N. Cellular Automata Machine A New Environment for Modeling (MIT Press, Cambridge, MA, 1987)"},{"key":"6_CR29","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0167-2789(90)90185-R","volume":"45","author":"T Toffoli","year":"1990","unstructured":"Toffoli T. and Margolus N. Invertible cellular automata: A review Physica D 45 (1990) 229\u2013253","journal-title":"Physica D"},{"key":"6_CR30","doi-asserted-by":"publisher","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 Journal of Computer and System Sciences 15 (1977) 213\u2013231","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-2789(84)90245-8","volume":"10","author":"S Wolfram","year":"1984","unstructured":"Wolfram S. Universality and complexity in cellular automata Physica D 10 (1984) 1\u201335","journal-title":"Physica D"}],"container-title":["Collision-Based Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-0129-1_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,28]],"date-time":"2021-11-28T04:35:14Z","timestamp":1638074114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-0129-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9781852335403","9781447101291"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-0129-1_6","relation":{},"subject":[],"published":{"date-parts":[[2002]]}}}