{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T11:27:53Z","timestamp":1725190073697},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6803,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/s0022-0000(05)80077-7","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"718-725","source":"Crossref","is-referenced-by-count":18,"title":["The surjectivity problem for 2D cellular automata"],"prefix":"10.1016","volume":"49","author":[{"given":"Bruno","family":"Durand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80077-7_bib1","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(72)80013-8","article-title":"Decision procedures for surjectiviy and injectivity of parallel maps for tesselation structures","volume":"6","author":"Amoroso","year":"1972","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80077-7_bib2","article-title":"The undecidability of the domino problem","volume":"66","author":"Berger","year":"1966","journal-title":"Mem. Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(05)80077-7_bib3","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1137\/0218057","article-title":"On the limit sets of cellular automata","volume":"18","author":"Culik","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80077-7_bib4","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0167-2789(90)90195-U","article-title":"Reversability of 2d cellular automata is undecidable","volume":"45","author":"Kari","year":"1990","journal-title":"Physica D"},{"key":"10.1016\/S0022-0000(05)80077-7_bib5","doi-asserted-by":"crossref","DOI":"10.1016\/S0022-0000(05)80025-X","article-title":"Reversibility and surjectivity problems of cellular automata","volume":"48","author":"Kari","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80077-7_bib6","first-page":"13","article-title":"Machine models of self-reproduction","volume":"14","author":"Moore","year":"1962"},{"issue":"No. 6","key":"10.1016\/S0022-0000(05)80077-7_bib7","first-page":"984","article-title":"A simple construction method of a reversible finite automaton out of fredkin gates, and its related model","volume":"E","author":"Morita","year":"1990","journal-title":"Trans. IEICE"},{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80077-7_bib8","first-page":"141","article-title":"Computation-universal models of two dimensional 16-state reversible automata","volume":"E75-D","author":"Morita","year":"1992","journal-title":"IEICE Trans. Inform. Systems"},{"key":"10.1016\/S0022-0000(05)80077-7_bib9","first-page":"485","article-title":"The converse to Moore's garden-of-eden theorem","volume":"14","author":"Myhill","year":"1963"},{"key":"10.1016\/S0022-0000(05)80077-7_bib10","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/S0022-0000(72)80009-6","article-title":"Tesselations with local transformations","volume":"6","author":"Richardson","year":"1972","journal-title":"J. Compu. System Sci."},{"key":"10.1016\/S0022-0000(05)80077-7_bib11","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01418780","article-title":"Undecidability and nonperiodicity for tilings of the plane","volume":"12","author":"Robinson","year":"1971","journal-title":"Invent. Math."},{"key":"10.1016\/S0022-0000(05)80077-7_bib12","series-title":"\u201cFCT'93,\u201d Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-57163-9_35","article-title":"One-way cellular automata on Cayley graphs (short version)","author":"R\u00f3ka","year":"1993"},{"key":"10.1016\/S0022-0000(05)80077-7_bib13","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(94)90236-4","article-title":"One-way cellular automata on Cayley graphs","author":"R\u00f3ka","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80077-7_bib14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0167-2789(90)90185-R","article-title":"Inverible cellular automata: A review","volume":"45","author":"Toffoli","year":"1990","journal-title":"Physica D"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800777?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800777?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T22:27:01Z","timestamp":1548196021000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800777"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["S0022000005800777"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80077-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}