{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T12:38:10Z","timestamp":1700829490888},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1977,1,1]],"date-time":"1977-01-01T00:00:00Z","timestamp":220924800000},"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":13346,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1977]]},"DOI":"10.1016\/0012-365x(77)90103-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:33:13Z","timestamp":1027639993000},"page":"235-239","source":"Crossref","is-referenced-by-count":13,"title":["A simplified proof of parikh's theorem"],"prefix":"10.1016","volume":"19","author":[{"given":"J.","family":"Goldstine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(77)90103-0_BIB1","article-title":"The Theory of Parsing, Translation, and Compiling","volume":"Vol. 1","author":"Aho","year":"1972"},{"key":"10.1016\/0012-365X(77)90103-0_BIB2","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. Kommunikat."},{"key":"10.1016\/0012-365X(77)90103-0_BIB3","series-title":"Regular Algebra and Finite Machines","author":"Conway","year":"1971"},{"key":"10.1016\/0012-365X(77)90103-0_BIB4","series-title":"The Mathematical Theory of Context-free Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/0012-365X(77)90103-0_BIB5","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0022-0000(71)80024-7","article-title":"AFL with the semilinear property","volume":"5","author":"Ginsburg","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0012-365X(77)90103-0_BIB6","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0012-365X(72)90013-1","article-title":"A generalization of Parikh's semilinear theorem","volume":"2","author":"Greibach","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(77)90103-0_BIB7","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/S0022-0000(71)80023-5","article-title":"A characterization of context-free languages","volume":"5","author":"Gruska","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0012-365X(77)90103-0_BIB8","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. Sys. Th."},{"key":"10.1016\/0012-365X(77)90103-0_BIB9","first-page":"199","article-title":"Language generating devices","author":"Parikh","year":"1961","journal-title":"Quart. Prog. Rep. No. 60"},{"key":"10.1016\/0012-365X(77)90103-0_BIB10","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","article-title":"On context-free languages","volume":"13","author":"Parikh","year":"1966","journal-title":"J. ACM"},{"issue":"II","key":"10.1016\/0012-365X(77)90103-0_BIB11","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1112\/jlms\/s2-6.4.663","article-title":"Commutative regular equations and Parikh's theorem","volume":"6","author":"Pilling","year":"1973","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(77)90103-0_BIB12","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/0012-365X(77)90103-0_BIB13","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0019-9958(67)90529-3","article-title":"A representation theorem for algebraic and context-free power series in noncommuting variables","volume":"11","author":"Shamir","year":"1967","journal-title":"Inf. and Control"},{"key":"10.1016\/0012-365X(77)90103-0_BIB14","first-page":"17","article-title":"A generalization of Perikh's Theorem in formal language theory","author":"van Leeuwen","year":"1974","journal-title":"Proc. of the 2nd Int. Conf. on Automata, Languages and Programming, Saarbruecken"},{"key":"10.1016\/0012-365X(77)90103-0_BIB15","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0304-3975(76)90052-9","article-title":"A strong pumping lemma for context-free languages","author":"Wise","year":"1976","journal-title":"Theoret. Comput. Sci."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X77901030?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X77901030?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:58:34Z","timestamp":1555138714000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X77901030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1977]]}},"alternative-id":["0012365X77901030"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(77)90103-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1977]]}}}