{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,14]],"date-time":"2026-10-14T09:48:09Z","timestamp":1791971289815,"version":"4.3.4"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540929093","type":"print"},{"value":"9783540929109","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-540-92910-9_1","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T10:54:06Z","timestamp":1345892046000},"page":"3-24","source":"Crossref","is-referenced-by-count":18,"title":["Basic Concepts of Cellular Automata"],"prefix":"10.1007","author":[{"given":"Jarkko J.","family":"Kari","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"1_CR00011","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(72)80013-8","volume":"6","author":"S Amoroso","year":"1972","unstructured":"Amoroso S, Patt Y (1972) Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures. J Comput Syst Sci 6:448\u2013464","journal-title":"J Comput Syst Sci"},{"key":"1_CR00012","first-page":"1","volume":"66","author":"R Berger","year":"1966","unstructured":"Berger R (1966) The undecidability of the domino problem. Mem Amer Math Soc 66:1\u201372","journal-title":"Mem Amer Math Soc"},{"key":"1_CR00013","unstructured":"Berlekamp ER, Conway JH, Guy RK (1982) Winning ways for your mathematical plays, vol II, chap 25. Academic, London"},{"key":"1_CR00014","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF02760680","volume":"99","author":"F Blanchard","year":"1997","unstructured":"Blanchard F, Maass A (1997) Dynamical properties of expansive one-sided cellular automata. Israel J Math 99:149\u2013174","journal-title":"Israel J Math"},{"issue":"5","key":"1_CR00015","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/S0246-0203(00)00141-2","volume":"36","author":"F Blanchard","year":"2000","unstructured":"Blanchard F, Tisseur P (2000) Some properties of cellular automata with equicontinuity points. Ann Inst Henri Poincar\u00e9, Probab Stat 36(5):569\u2013582","journal-title":"Ann Inst Henri Poincar\u00e9, Probab Stat"},{"key":"1_CR00016","first-page":"3","volume-title":"Essays on cellular automata","author":"A Burks","year":"1970","unstructured":"Burks A (1970) Von Neumann's self-reproducing automata. In: Burks A (ed) Essays on cellular automata, University of Illinois Press, Champaign, pp 3\u201364"},{"issue":"1","key":"1_CR00017","doi-asserted-by":"publisher","first-page":"58","DOI":"10.2307\/2975215","volume":"103","author":"B Codenotti","year":"1996","unstructured":"Codenotti B, Margara L (1996) Transitive cellular automata are sensitive. Am Math Mon 103(1):58\u201362","journal-title":"Am Math Mon"},{"key":"1_CR00018","doi-asserted-by":"crossref","first-page":"1","DOI":"10.25088\/ComplexSystems.15.1.1","volume":"15","author":"M Cook","year":"2004","unstructured":"Cook M (2004) Universality in elementary cellular automata. Complex Syst 15:1\u201340","journal-title":"Complex Systems"},{"key":"1_CR00019","doi-asserted-by":"crossref","unstructured":"Czeizler E, Kari J (2005) A tight linear bound on the neighborhood of inverse cellular automata. In: Caires L, Italiano GF, Monteiro L, Palamidessi C, Yung M (eds) ICALP, Lecture notes in computer science, vol 3580, Springer, Berlin, pp 410\u2013420","DOI":"10.1007\/11523468_34"},{"key":"1_CR000110","volume-title":"An introduction to chaotic dynamical systems","author":"RL Devaney","year":"1986","unstructured":"Devaney RL (1986) An introduction to chaotic dynamical systems. Benjamin\/Cummings, Menlo Park, CA"},{"key":"1_CR000111","volume-title":"Cellular automata and complex systems","author":"B Durand","year":"1998","unstructured":"Durand B (1998) Global properties of cellular automata. In: Goles E, Martinez S (eds) Cellular automata and complex systems. Kluwer, Dordrecht"},{"key":"1_CR000112","doi-asserted-by":"crossref","unstructured":"Durand B, Formenti E, Varouchas G (2003) On undecidability of equicontinuity classification for cellular automata. In: Morvan M, Remila E (eds) Discrete models for complex systems, DMCS\u201903, DMTCS Conference Volume AB, Lyon, France, pp 117\u2013128","DOI":"10.46298\/dmtcs.2302"},{"issue":"4","key":"1_CR000113","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1038\/scientificamerican1070-120","volume":"223","author":"M Gardner","year":"1970","unstructured":"Gardner M (1970) The fantastic combinations of John Conway's new solitaire game \u201c Life \u201d. Sci Am 223(4): 120\u2013123","journal-title":"Sci Am"},{"key":"1_CR000114","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BF01691062","volume":"3","author":"GA Hedlund","year":"1969","unstructured":"Hedlund GA (1969) Endomorphisms and automorphisms of the shift dynamical system. Math Syst Theor 3:320\u2013375","journal-title":"Math System Theory"},{"issue":"3","key":"1_CR000115","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1137\/0221036","volume":"21","author":"J Kari","year":"1992","unstructured":"Kari J (1992) The nilpotency problem of one-dimensional cellular automata. SIAM J Comput 21(3):571\u2013586","journal-title":"SIAM J Comput"},{"issue":"1","key":"1_CR000116","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 (1994) Reversibility and surjectivity problems of cellular automata. J Comput Syst Sci 48(1):149\u2013182","journal-title":"J Comput Syst Sci"},{"key":"1_CR000117","doi-asserted-by":"crossref","unstructured":"Kari J, Ollinger N (2008) Periodicity and immortality in reversible computing. In: Ochmanski E, Tyszkiewicz J (eds) MFCS, Lecture notes in computer science, vol 5162, Springer, Berlin, pp 419\u2013430","DOI":"10.1007\/978-3-540-85238-4_34"},{"key":"1_CR000118","doi-asserted-by":"crossref","unstructured":"Kari J, Vanier P, Zeume T (2009) Bounds on non-surjective cellular automata. In: Kr\u00e1lovic R, Urzyczyn P (eds) MFCS, Lecture notes in computer Science, vol 5734, Springer, Berlin, pp 439\u2013450","DOI":"10.1007\/978-3-642-03816-7_38"},{"key":"1_CR000119","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1017\/S014338579706985X","volume":"17","author":"P K\u016frka","year":"1997","unstructured":"K\u016frka P (1997) Languages, equicontinuity and attractors in cellular automata. Ergod Theor Dyn Syst 17:417\u2013433","journal-title":"Ergod Theor Dyn Syst"},{"key":"1_CR000120","first-page":"241","volume":"5","author":"V Lukkarila","year":"2010","unstructured":"Lukkarila V (2010) Sensitivity and topological mixing are undecidable for reversible one-dimensional cellular automata. J Cell Autom 5:241\u2013272","journal-title":"J Cell Autom"},{"key":"1_CR000130","doi-asserted-by":"crossref","unstructured":"Maruoka A, Kimura M (1976) Condition for injectivity of global maps for tessellation automata. Inform Control 32(2):158\u2013162. doi: 10.1016\/S0019-9958(76)90195-9, URL http:\/\/www.sciencedirect.com\/science\/article\/B7MFM-4DX4D7R-V\/2\/409f935b249fa44868bb569dffb5eb37","DOI":"10.1016\/S0019-9958(76)90195-9"},{"key":"1_CR000121","first-page":"17","volume-title":"Machine models of self-reproduction","author":"EF Moore","year":"1962","unstructured":"Moore EF (1962) Machine models of self-reproduction. In: Bellman RE (ed) Proceedings of symposia in applied mathematics XIV: \u201cMathematical problems in the biological sciences\u201d, AMS, pp 17\u201333"},{"key":"1_CR000122","first-page":"685","volume":"14","author":"J Myhill","year":"1963","unstructured":"Myhill J (1963) The converse of Moore's Garden-of-Eden theorem. Proc Am Math Soc 14:685\u2013686","journal-title":"Proc Am Math Soc"},{"key":"1_CR000123","volume-title":"Theory of self-reproducing automata","author":"J von Neumann","year":"1966","unstructured":"von Neumann J (1966) Theory of self-reproducing automata. In: Burks AW (ed) University of Illinois Press, Urbana, London"},{"key":"1_CR000124","first-page":"523","volume-title":"Topological dynamics of 2D cellular automata","author":"M Sablik","year":"2008","unstructured":"Sablik M, Theyssier G (2008) Topological dynamics of 2D cellular automata. In: CiE \u201908: Proceedings of the 4th conference on computability in Europe, Springer, Berlin, Heidelberg, pp 523\u2013532"},{"issue":"2","key":"1_CR000125","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0019-3577(93)90040-6","volume":"4","author":"MA Shereshevsky","year":"1993","unstructured":"Shereshevsky MA (1993) Expansiveness, entropy and polynomial growth for groups acting on subshifts by automorphisms. Indag Math 4(2):203\u2013210","journal-title":"Indag Math"},{"key":"1_CR000126","first-page":"19","volume":"5","author":"K Sutner","year":"1991","unstructured":"Sutner K (1991) De Bruijn graphs and linear cellular automata. Complex Syst 5:19\u201331","journal-title":"Complex Systems"},{"key":"1_CR000127","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/j.1538-7305.1961.tb03975.x","volume":"40","author":"H Wang","year":"1961","unstructured":"Wang H (1961) Proving theorems by pattern recognition - ii. Bell Syst Tech J 40:1\u201342","journal-title":"Bell Syst Tech J"},{"key":"1_CR000128","volume-title":"Theory and applications of cellular automata","year":"1986","unstructured":"Wolfram S (ed) (1986) Theory and applications of cellular automata. World Scientific, Singapore"},{"key":"1_CR000129","volume-title":"A new kind of science","author":"S Wolfram","year":"2002","unstructured":"Wolfram S (2002) A new kind of science. Wolfram Media, Champaign, IL, USA"}],"container-title":["Handbook of Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92910-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,14]],"date-time":"2026-10-14T08:57:25Z","timestamp":1791968245000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-92910-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783540929093","9783540929109"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92910-9_1","relation":{},"subject":[],"published":{"date-parts":[[2012]]}}}