{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:13:18Z","timestamp":1759335198566},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540443117"},{"type":"electronic","value":"9783540458333"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45833-6_14","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T06:25:53Z","timestamp":1186813553000},"page":"164-175","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata"],"prefix":"10.1007","author":[{"given":"Katsunobu","family":"Imai","sequence":"first","affiliation":[]},{"given":"Kenji","family":"Fujita","sequence":"additional","affiliation":[]},{"given":"Chuzo","family":"Iwamoto","sequence":"additional","affiliation":[]},{"given":"Kenichi","family":"Morita","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"key":"14_CR1","unstructured":"Boccara, N. and Fuk\u015b, H.: Number-conserving cellular automaton rules, Fundamenta Informaticae (to Appear)."},{"key":"14_CR2","unstructured":"Dewdney, A. K.: Computer recreations: the cellular automata programs that create wireworld, rugworld and other diversions, Scientific American Jan. (1990) 136\u2013139."},{"key":"14_CR3","unstructured":"Durand, B., Formenti, E. and Roka, Z.: Number conserving cellular automata: from decidability to dynamics, nlin.CG\/0102035, (2001) (\n                    http:\/\/arxiv.org\/list\/nlin.CG\/0102\n                    \n                  )."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"1505","DOI":"10.1103\/PhysRevLett.56.1505","volume":"56","author":"U. Frisch","year":"1986","unstructured":"Frisch, U., Hasslacher, B. and Pomeau, Y.: Lattice-Gas Automata for the Navier-Stokes equation, Physical Review Letters 56 (1986) 1505\u20131508.","journal-title":"Physical Review Letters"},{"key":"14_CR5","first-page":"295","volume":"49D","author":"T. Hattori","year":"1991","unstructured":"Hattori, T. and Takesue, S.: Additive conserved quantities in discrete-time lattice dynamical systems, Physica 49D (1991) 295\u2013322.","journal-title":"Physica"},{"key":"14_CR6","first-page":"135","volume":"10D","author":"C.G. Langton","year":"1984","unstructured":"Langton, C.G.: Self-reproduction in cellular automata, Physica10D(1984) 135\u2013144.","journal-title":"Physica"},{"key":"14_CR7","first-page":"81","volume":"10D","author":"N. Margolus","year":"1984","unstructured":"Margolus, N.: Physics-like models of computation, Physica, 10D (1984) 81\u201395.","journal-title":"Physica"},{"key":"14_CR8","first-page":"758","volume":"E72","author":"K. Morita","year":"1989","unstructured":"Morita, K. and Harao, M.: Computation universality of one-dimensional reversible (injective) cellular automata, Trans. IEICE Japan E72 (1989) 758\u2013762.","journal-title":"Trans. IEICE Japan"},{"key":"14_CR9","unstructured":"Morita, K. and Imai, K.: Number-conserving reversible cellular automata and their computation-universality, Proceedings of MFCS\u201998 Workshop on Cellular Automata, Brno (1998) 51\u201368."},{"issue":"2","key":"14_CR10","first-page":"2221","volume":"I","author":"K. Nagel","year":"1992","unstructured":"Nagel, K. and Schreckenberg, M.: A cellular automaton model for freeway traffic, Journal of Physics I,2 (1992) 2221\u20132229.","journal-title":"Journal of Physics"},{"key":"14_CR11","unstructured":"Tojima, Y.: Logic circuit composition on a two-dimensional three-state cellular automaton, Bachelor thesis, Hiroshima University (1997) (in Japanese)."},{"key":"14_CR12","unstructured":"Washio, T.: On self-reproduction in number-conserving reversible cellular automata, Bachelor thesis, Hiroshima University (1999) (in Japanese)."}],"container-title":["Lecture Notes in Computer Science","Unconventional Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45833-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:11:52Z","timestamp":1558260712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45833-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540443117","9783540458333"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45833-6_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"10 October 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}