{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T00:45:37Z","timestamp":1768265137497,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[1967,11,1]],"date-time":"1967-11-01T00:00:00Z","timestamp":-68428800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,5,15]],"date-time":"2014-05-15T00:00:00Z","timestamp":1400112000000},"content-version":"vor","delay-in-days":16997,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1967,11]]},"DOI":"10.1016\/s0019-9958(67)90771-1","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T06:51:40Z","timestamp":1103093500000},"page":"561-567","source":"Crossref","is-referenced-by-count":40,"title":["An analog of a theorem about context-free languages"],"prefix":"10.1016","volume":"11","author":[{"given":"Barron","family":"Brainerd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(67)90771-1_bib1","first-page":"61","article-title":"Some questions of phrase structure grammars I","volume":"4","author":"Abraham","year":"1965","journal-title":"Computational Ling."},{"key":"10.1016\/S0019-9958(67)90771-1_bib2","first-page":"116","article-title":"Language and Information","author":"Bar-Hillel","year":"1964"},{"key":"10.1016\/S0019-9958(67)90771-1_bib3","first-page":"143","article-title":"On formal properties of simple phrase structure grammars","volume":"14","author":"Bar-Hillel","year":"1961","journal-title":"Z. Phonetik, Sprachwiss. Kommunikationforschung"},{"key":"10.1016\/S0019-9958(67)90771-1_bib4","article-title":"Les Langages CS","author":"Friant","year":"1966","journal-title":"Th\u00e8se pr\u00e9sent\u00e9e \u00e0 la Facult\u00e9 des Sciences de l'Universit\u00e9 de Paris"},{"key":"10.1016\/S0019-9958(67)90771-1_bib5","series-title":"The Mathematical Theory of Context-free Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/S0019-9958(67)90771-1_bib6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(64)90120-2","article-title":"Classes of languages and linear-bounded automata","volume":"7","author":"Kuroda","year":"1964","journal-title":"Inform. Control"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995867907711?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995867907711?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T14:53:14Z","timestamp":1548946394000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995867907711"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1967,11]]},"references-count":6,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[1967,11]]}},"alternative-id":["S0019995867907711"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(67)90771-1","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1967,11]]}}}