{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:07:46Z","timestamp":1760202466716},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,4,1]],"date-time":"1982-04-01T00:00:00Z","timestamp":386467200000},"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":11430,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1982,4]]},"DOI":"10.1016\/0304-3975(82)90110-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"33-40","source":"Crossref","is-referenced-by-count":16,"title":["A pushdown automation or a context-free grammar\u2014which is more economical?"],"prefix":"10.1016","volume":"18","author":[{"given":"Jonathan","family":"Goldstine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John K.","family":"Price","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Detlef","family":"Wotschke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90110-4_BIB1","volume":"Vol. 1","author":"Aho","year":"1972"},{"key":"10.1016\/0304-3975(82)90110-4_BIB2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0304-3975(77)90033-0","article-title":"Economy of description by parsers, DPDAs and PDAs","volume":"4","author":"Geller","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(82)90110-4_BIB3","series-title":"The Mathematical Theory of Context-Free Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/0304-3975(82)90110-4_BIB4","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1145\/321978.321980","article-title":"Size complexity in context-free grammar forms","volume":"23","author":"Ginsburg","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(82)90110-4_BIB5","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0304034","article-title":"Finite-turn pushdown automata","volume":"4","author":"Ginsburg","year":"1966","journal-title":"SIAM J. Control"},{"key":"10.1016\/0304-3975(82)90110-4_BIB6","first-page":"65","article-title":"Descriptional complexity (of languages), a short survey","volume":"45","author":"Gruska","year":"1976"},{"key":"10.1016\/0304-3975(82)90110-4_BIB7","series-title":"Formal Languages and their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/0304-3975(82)90110-4_BIB8","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1109\/SWAT.1971.11","article-title":"Economy of description by automata, grammars, and formal systems","author":"Meyer","year":"1971","journal-title":"Proc. 12th Symposium on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(82)90110-4_BIB9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01694004","article-title":"A helpful result for proving inherent ambiguity","volume":"2","author":"Ogden","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(82)90110-4_BIB10","first-page":"292","article-title":"Complexity and normal forms of context-free languages","volume":"28","author":"Pirick\u00e1","year":"1974"},{"key":"10.1016\/0304-3975(82)90110-4_BIB11","first-page":"344","article-title":"Greibach normal form complexity","volume":"32","author":"Pirick\u00e1-Kelemenov\u00e1","year":"1975"},{"key":"10.1016\/0304-3975(82)90110-4_BIB12","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1137\/0206039","article-title":"Succinctness of descriptions of unambiguous context-free languages","volume":"6","author":"Schmidt","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(82)90110-4_BIB13","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0019-9958(76)90173-X","article-title":"A note on the succinctness of descriptions of deterministic languages","volume":"32","author":"Valiant","year":"1976","journal-title":"Information and Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582901104?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582901104?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:26:17Z","timestamp":1555125977000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582901104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,4]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,4]]}},"alternative-id":["0304397582901104"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90110-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982,4]]}}}