{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T17:18:57Z","timestamp":1688491137644},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1975,4,1]],"date-time":"1975-04-01T00:00:00Z","timestamp":165542400000},"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":13987,"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,4]]},"DOI":"10.1016\/s0022-0000(75)80042-0","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"237-247","source":"Crossref","is-referenced-by-count":27,"title":["One counter languages and the IRS condition"],"prefix":"10.1016","volume":"10","author":[{"given":"S.A.","family":"Greibach","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(75)80042-0_bib1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0019-9958(63)90199-2","article-title":"Phrase structure languages, finite machines and channel capacity","volume":"6","author":"Banerji","year":"1963","journal-title":"Information and Control"},{"key":"10.1016\/S0022-0000(75)80042-0_bib2","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/S0019-9958(67)90771-1","article-title":"An analog of a theorem about context-free languages","volume":"11","author":"Brainerd","year":"1968","journal-title":"Information and Control"},{"key":"10.1016\/S0022-0000(75)80042-0_bib3","series-title":"Computer Programming and Formal Systems","first-page":"118","article-title":"The Algebraic Theory of Context-Free Languages","author":"Chomsky","year":"1963"},{"key":"10.1016\/S0022-0000(75)80042-0_bib4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1147\/rd.91.0047","article-title":"On relations defined by generalized finite automata","volume":"9","author":"Elgot","year":"1965","journal-title":"IMB J. Res. Develop."},{"key":"10.1016\/S0022-0000(75)80042-0_bib5","series-title":"Studies in Abstract Families of Languages","first-page":"1","article-title":"Abstract families of languages","author":"Ginsburg","year":"1969"},{"key":"10.1016\/S0022-0000(75)80042-0_bib6","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0022-0000(68)80009-1","article-title":"Derivation-bounded languages","volume":"2","author":"Ginsburg","year":"1968","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(75)80042-0_bib7","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1137\/0304034","article-title":"Finite-turn pushdown automata","volume":"4","author":"Ginsburg","year":"1966","journal-title":"SIAM J. Control"},{"key":"10.1016\/S0022-0000(75)80042-0_bib8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01691106","article-title":"Chains of full AFLs","volume":"4","author":"Greibach","year":"1970","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(75)80042-0_bib9","unstructured":"S. Greibach, Erasable context-free languages, unpublished manuscript."},{"key":"10.1016\/S0022-0000(75)80042-0_bib10","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/321495.321503","article-title":"An infinite hierarchy of context-free languages","volume":"16","author":"Greibach","year":"1969","journal-title":"JACM"},{"key":"10.1016\/S0022-0000(75)80042-0_bib11","series-title":"Proceedings Fourth ACM Symposium, Theory of Computing","first-page":"207","article-title":"Uniformly erasable AFL","author":"Greibach","year":"1972"},{"key":"10.1016\/S0022-0000(75)80042-0_bib12","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","article-title":"Linear automaton transformations","volume":"9","author":"Nerode","year":"1958","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(75)80042-0_bib13","article-title":"Transductions des languages de Chomsky","author":"Nivat","year":"1967"},{"key":"10.1016\/S0022-0000(75)80042-0_bib14","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1016\/S0019-9958(67)91032-7","article-title":"Inclusion relations among families of context-free languages","volume":"10","author":"Yntema","year":"1967","journal-title":"Information and Control"},{"key":"10.1016\/S0022-0000(75)80042-0_bib15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0020-0190(74)90050-7","article-title":"The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is proper","volume":"2","author":"Boasson","year":"1974","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0022-0000(75)80042-0_bib16","unstructured":"S. Greibach, Some context-free generators, in preparation."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000075800420?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000075800420?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:54:57Z","timestamp":1544140497000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000075800420"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,4]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1975,4]]}},"alternative-id":["S0022000075800420"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(75)80042-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1975,4]]}}}