{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:00:18Z","timestamp":1725512418152},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540797081"},{"type":"electronic","value":"9783540797098"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79709-8_21","type":"book-chapter","created":{"date-parts":[[2008,5,13]],"date-time":"2008-05-13T14:33:17Z","timestamp":1210689197000},"page":"194-203","source":"Crossref","is-referenced-by-count":1,"title":["The Most General Conservation Law for a Cellular Automaton"],"prefix":"10.1007","author":[{"given":"Enrico","family":"Formenti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jarkko","family":"Kari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siamak","family":"Taati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1007\/BF02196421","volume":"8","author":"A.P. Biryukov","year":"1967","unstructured":"Biryukov, A.P.: Some algorithmic problems for finitely defined commutative semigroups. Siberian Mathematical Journal\u00a08, 384\u2013391 (1967)","journal-title":"Siberian Mathematical Journal"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/S0304-3975(01)00382-6","volume":"289","author":"V.D. Blondel","year":"2002","unstructured":"Blondel, V.D., Cassaigne, J., Nichitiu, C.: On the presence of periodic configurations in Turing machines and in counter machines. Theoretical Computer Science\u00a0289, 573\u2013590 (2002)","journal-title":"Theoretical Computer Science"},{"key":"21_CR3","first-page":"1","volume":"52","author":"N. Boccara","year":"2002","unstructured":"Boccara, N., Fuk\u015b, H.: Number-conserving cellular automaton rules. Fundamenta Informaticae\u00a052, 1\u201313 (2002)","journal-title":"Fundamenta Informaticae"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0097-3165(90)90057-4","volume":"53","author":"J.H. Conway","year":"1990","unstructured":"Conway, J.H., Lagarias, J.C.: Tiling with polyominoes and combinatorial group theory. Journal of Combinatorial Theory A\u00a053, 183\u2013208 (1990)","journal-title":"Journal of Combinatorial Theory A"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/S0304-3975(02)00534-0","volume":"299","author":"B. Durand","year":"2003","unstructured":"Durand, B., Formenti, E., R\u00f3ka, Z.: Number conserving cellular automata I: decidability. Theoretical Computer Science\u00a0299, 523\u2013535 (2003)","journal-title":"Theoretical Computer Science"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0304-3975(03)00134-8","volume":"304","author":"E. Formenti","year":"2003","unstructured":"Formenti, E., Grange, A.: Number conserving cellular automata II: dynamics. Theoretical Computer Science\u00a0304, 269\u2013290 (2003)","journal-title":"Theoretical Computer Science"},{"key":"21_CR7","volume-title":"Semigroups: An Introduction to the Structure Theory","author":"P.A. Grillet","year":"1995","unstructured":"Grillet, P.A.: Semigroups: An Introduction to the Structure Theory. Dekker, New York (1995)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0167-2789(91)90150-8","volume":"49","author":"T. Hattori","year":"1991","unstructured":"Hattori, T., Takesue, S.: Additive conserved quantities in discrete-time lattice dynamical systems. Physica D\u00a049, 295\u2013322 (1991)","journal-title":"Physica D"},{"key":"21_CR9","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. Journal of Computer and System Sciences\u00a048, 149\u2013182 (1994)","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR10","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. Theoretical Computer Science\u00a0334, 3\u201333 (2005)","journal-title":"Theoretical Computer Science"},{"key":"21_CR11","volume-title":"Computation: Finite and Infinite Machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Moore, E.F.: Machine models of self-reproduction. In: Proceedings of Symposia in Applied Mathematics, pp. 17\u201333. AMS (1962)","DOI":"10.1090\/psapm\/014\/9961"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"685","DOI":"10.2307\/2034301","volume":"14","author":"J. Myhill","year":"1963","unstructured":"Myhill, J.: The converse of Moore\u2019s Garden-of-Eden theorem. Proceedings of the American Mathematical Society\u00a014, 685\u2013686 (1963)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"1781","DOI":"10.1088\/0951-7715\/15\/6\/305","volume":"15","author":"M. Pivato","year":"2002","unstructured":"Pivato, M.: Conservation laws in cellular automata. Nonlinearity\u00a015, 1781\u20131793 (2002)","journal-title":"Nonlinearity"},{"key":"21_CR15","first-page":"211","volume":"1","author":"A.D. Robison","year":"1987","unstructured":"Robison, A.D.: Fast computation of additive cellular automata. Complex Systems\u00a01, 211\u2013216 (1987)","journal-title":"Complex Systems"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"757","DOI":"10.2307\/2324578","volume":"97","author":"W.P. Thurston","year":"1990","unstructured":"Thurston, W.P.: Conway\u2019s tiling groups. American Mathematical Monthly\u00a097, 757\u2013773 (1990)","journal-title":"American Mathematical Monthly"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79709-8_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:28:47Z","timestamp":1619522927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79709-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540797081","9783540797098"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79709-8_21","relation":{},"subject":[]}}