{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T05:02:25Z","timestamp":1648875745679},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1974,8,1]],"date-time":"1974-08-01T00:00:00Z","timestamp":144547200000},"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":14230,"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":[[1974,8]]},"DOI":"10.1016\/s0022-0000(74)80040-1","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"88-108","source":"Crossref","is-referenced-by-count":8,"title":["On incomparable abstract family of languages (AFL)"],"prefix":"10.1016","volume":"9","author":[{"given":"Seymour","family":"Ginsburg","sequence":"first","affiliation":[]},{"given":"Edwin H.","family":"Spanier","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(74)80040-1_bib1","unstructured":"S. Ginsburg, \u201cAlgebraic and Automata\u2014Theoretic Properties of Formal Languages,\u201d, North-Holland, Amsterdam, in press."},{"key":"10.1016\/S0022-0000(74)80040-1_bib2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0019-9958(73)90274-X","article-title":"Intersection-closed full AFL and the recursively enumerable languages","volume":"22","author":"Ginsburg","year":"1973","journal-title":"Information and Control"},{"issue":"No. 87","key":"10.1016\/S0022-0000(74)80040-1_bib3","first-page":"1","article-title":"Abstract families of languages","author":"Ginsburg","year":"1969","journal-title":"Mem. Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(74)80040-1_bib4","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(70)80016-2","article-title":"Principal AFL","volume":"4","author":"Ginsburg","year":"1970","journal-title":"J. Comput. Sys. Sci."},{"key":"10.1016\/S0022-0000(74)80040-1_bib5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0020-0255(70)80044-5","article-title":"Substitution in families of languages","volume":"2","author":"Ginsburg","year":"1970","journal-title":"Information Sci."},{"key":"10.1016\/S0022-0000(74)80040-1_bib6","series-title":"Ph.D. Thesis","article-title":"Abstract Families of Languages Generated by Bounded Languages","author":"Goldstine","year":"1970"},{"key":"10.1016\/S0022-0000(74)80040-1_bib7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01691106","article-title":"Chains of full AFL's","volume":"4","author":"Greibach","year":"1970","journal-title":"Math. Sys. Theor."},{"key":"10.1016\/S0022-0000(74)80040-1_bib8","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/S0019-9958(70)80039-0","article-title":"Full AFL's and nested iteration substitution","volume":"16","author":"Greibach","year":"1970","journal-title":"Informational and Control"},{"key":"10.1016\/S0022-0000(74)80040-1_bib9","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/S0022-0000(72)80039-4","article-title":"Simple syntactic operators on full's semi-AFL's","volume":"6","author":"Greibach","year":"1972","journal-title":"J. Comput. Sys. Sci."},{"issue":"No. 87","key":"10.1016\/S0022-0000(74)80040-1_bib10","first-page":"33","article-title":"Independence of AFL operations","author":"Greibach","year":"1969","journal-title":"Mem. Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(74)80040-1_bib11","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","article-title":"Recursive unsolvability of Post's problem of \u2018tag\u2019 and other topics in the theory of Turing machines","volume":"74","author":"Minsky","year":"1961","journal-title":"Ann. of Math."},{"key":"10.1016\/S0022-0000(74)80040-1_bib12","unstructured":"J. Rubin, \u201cSet Theory for the Mathematician\u201d, Holden-Day, San Francisco, CA."},{"key":"10.1016\/S0022-0000(74)80040-1_bib13","article-title":"Necessary Conditions for Containment of Principal (Semi-) AFL with Bounded Generators","author":"Rovan","year":"1972"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800401?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800401?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T23:52:13Z","timestamp":1544140333000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000074800401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,8]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1974,8]]}},"alternative-id":["S0022000074800401"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(74)80040-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1974,8]]}}}