{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T15:22:39Z","timestamp":1772205759995,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1975,8,1]],"date-time":"1975-08-01T00:00:00Z","timestamp":176083200000},"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":13865,"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,8]]},"DOI":"10.1016\/s0022-0000(75)80051-1","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"86-117","source":"Crossref","is-referenced-by-count":80,"title":["Context-free grammar forms"],"prefix":"10.1016","volume":"11","author":[{"given":"Armin","family":"Cremers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seymour","family":"Ginsburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(75)80051-1_bib1","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0019-9958(59)90362-6","article-title":"On certain formal properties of grammars","volume":"2","author":"Chomsky","year":"1959","journal-title":"Inform. Contr."},{"key":"10.1016\/S0022-0000(75)80051-1_bib2","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)80051-1_bib3","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/321812.321817","article-title":"Grammar schemata","volume":"21","author":"Gabrielian","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(75)80051-1_bib4","author":"Ginsburg","year":"1966"},{"key":"10.1016\/S0022-0000(75)80051-1_bib5","author":"Ginsburg","year":"1975"},{"key":"10.1016\/S0022-0000(75)80051-1_bib6","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)80051-1_bib7","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0022-0000(68)80009-1","article-title":"Derivation-bounded languages","volume":"5","author":"Ginsburg","year":"1968","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(75)80051-1_bib8","unstructured":"S. Ginsburg and E. H. Spanier, Substitution of grammar forms, to appear."},{"key":"10.1016\/S0022-0000(75)80051-1_bib9","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/S0022-0000(72)80039-4","article-title":"Simple syntactic operators on full semi-AFL's","volume":"6","author":"Greibach","year":"1972","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(75)80051-1_bib10","series-title":"Studies in Abstract Families of Languages","first-page":"33","article-title":"Independence of AFL operations","author":"Greibach","year":"1969"},{"key":"10.1016\/S0022-0000(75)80051-1_bib11","author":"Maurer","year":"1969"},{"key":"10.1016\/S0022-0000(75)80051-1_bib12","article-title":"Transductions des langages de Chomsky","author":"Nivat","year":"1967","journal-title":"Ph.D. Thesis, Paris"},{"key":"10.1016\/S0022-0000(75)80051-1_bib13","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1016\/S0019-9958(69)90164-8","article-title":"On the index of context-free grammars and languages","volume":"14","author":"Salomaa","year":"1969","journal-title":"Inform. Contr."},{"issue":"No. 76","key":"10.1016\/S0022-0000(75)80051-1_bib14","first-page":"276","article-title":"Finite State Representations of Context-Free Languages","author":"Stanley","year":"1965","journal-title":"MIT Research Laboratory Quarterly Progress Report"},{"key":"10.1016\/S0022-0000(75)80051-1_bib15","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":"Inform. Contr."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000075800511?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000075800511?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:48Z","timestamp":1544140488000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000075800511"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,8]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1975,8]]}},"alternative-id":["S0022000075800511"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(75)80051-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1975,8]]}}}