{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:39:03Z","timestamp":1725863943140},"publisher-location":"Cham","reference-count":6,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319443645"},{"type":"electronic","value":"9783319443652"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44365-2_7","type":"book-chapter","created":{"date-parts":[[2016,8,29]],"date-time":"2016-08-29T09:39:38Z","timestamp":1472463578000},"page":"66-78","source":"Crossref","is-referenced-by-count":1,"title":["The Garden of Eden Theorem for Cellular Automata on Group Sets"],"prefix":"10.1007","author":[{"given":"Simon","family":"Wacker","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,30]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Ceccherini-Silberstein, T., Coornaert, M.: Cellular Automata and Groups. Springer Monographs in Mathematics. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-14034-1"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Moore, E.F.: Machine models of self-reproduction. In: Proceedings of Symposia in Applied Mathematics, vol. 14, pp. 17\u201333 (1962)","DOI":"10.1090\/psapm\/014\/9961"},{"key":"7_CR3","first-page":"685","volume":"14","author":"JR Myhill","year":"1963","unstructured":"Myhill, J.R.: The converse of Moore\u2019s Garden-of-Eden theorem. Proc. Am. Math. Soc. 14, 685\u2013686 (1963)","journal-title":"Proc. Am. Math. Soc."},{"issue":"6","key":"7_CR4","first-page":"461","volume":"6","author":"S Moriceau","year":"2011","unstructured":"Moriceau, S.: Cellular automata on a $$G$$ -Set. Journal Cellular Automata 6(6), 461\u2013486 (2011)","journal-title":"Journal Cellular Automata"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-39300-1_15","volume-title":"Cellular Automata and Discrete Complex Systems","author":"S Wacker","year":"2016","unstructured":"Wacker, S.: Cellular automata on group sets and the uniform Curtis-Hedlund-Lyndon theorem. In: Cook, M., Neary, T. (eds.) AUTOMATA 2016. LNCS, vol. 9664, pp. 185\u2013198. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-39300-1_15"},{"key":"7_CR6","unstructured":"Wacker, S.: Right Amenable Left Group Sets and the Tarski-F\u00f8lner Theorem [math.GR]. arXiv:1603.06460"}],"container-title":["Lecture Notes in Computer Science","Cellular Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44365-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:33:35Z","timestamp":1498325615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44365-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319443645","9783319443652"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44365-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}