{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T12:05:33Z","timestamp":1648555533041},"reference-count":3,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1975,2,1]],"date-time":"1975-02-01T00:00:00Z","timestamp":160444800000},"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":14046,"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":[[1975,2]]},"DOI":"10.1016\/s0022-0000(75)80015-8","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T04:46:40Z","timestamp":1289364400000},"page":"77-82","source":"Crossref","is-referenced-by-count":12,"title":["Some clarifications of the concept of a Garden-of-Eden configuration"],"prefix":"10.1016","volume":"10","author":[{"given":"Serafino","family":"Amoroso","sequence":"first","affiliation":[]},{"given":"Gerald","family":"Cooper","sequence":"additional","affiliation":[]},{"given":"Yale","family":"Patt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(75)80015-8_bib1","doi-asserted-by":"crossref","first-page":"309","DOI":"10.2307\/2964290","article-title":"Three theorems on recursive enumeration","volume":"33","author":"Friedberg","year":"1958","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0022-0000(75)80015-8_bib2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(64)90120-2","article-title":"Classes of languages and linearly bounded automata","volume":"2","author":"Kuroda","year":"1964","journal-title":"Information and Control"},{"key":"10.1016\/S0022-0000(75)80015-8_bib3","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relations between nondeterministic and deterministic tape complexities","volume":"4","author":"Sa\u0159itch","year":"1970","journal-title":"J. Comput. System Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000075800158?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000075800158?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T18:55:02Z","timestamp":1544122502000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000075800158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,2]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1975,2]]}},"alternative-id":["S0022000075800158"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(75)80015-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1975,2]]}}}