{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:37Z","timestamp":1725456757191},"publisher-location":"Berlin\/Heidelberg","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029646","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"485-491","source":"Crossref","is-referenced-by-count":0,"title":["A stronger version of parikh theorem"],"prefix":"10.1007","author":[{"given":"Pham Huu","family":"Uyen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"55_CR1","unstructured":"M.P. Chytil, Kins of CFL, Proceeding of MFCS'86, Lecture Notes in CS vol.233 Springer-Verlag"},{"key":"55_CR2","doi-asserted-by":"crossref","first-page":"283","DOI":"10.3233\/FI-1986-9303","volume":"IX","author":"M.P. Chytil","year":"1986","unstructured":"M.P. Chytil, Almost Context Free Languages, Fundamenta Informaticae IX(1986), 283\u2013322 North-Holland.","journal-title":"Fundamenta Informaticae"},{"key":"55_CR3","unstructured":"M. Chytil, Limity posloupnost\u00ed CF gramatik, Praha 1987."},{"key":"55_CR4","doi-asserted-by":"crossref","unstructured":"F.J.Brandenburg On one-way auxiliary pushdown automata Proc. of 3rd GI conf. Theor. Comp. Sci. LNCS 48, 1977.","DOI":"10.1007\/3-540-08138-0_11"},{"key":"55_CR5","doi-asserted-by":"crossref","unstructured":"S.Ginsburg, The mathematical theory of context-free languages. McGraw Hill 1966.","DOI":"10.1145\/321312.321318"},{"key":"55_CR6","unstructured":"A.Salomaa, Formal languages, Academic Press 1973"},{"key":"55_CR7","unstructured":"M.P.Chytil \u2014 M.Platek \u2014 J. Vogel A note on the Chomsky hierarchy, The Bulletin of the EATCS 27, 1985."},{"key":"55_CR8","unstructured":"Semilinear structure of a-languages. TR No.56\/1989 Depart. Comp. Sci., Charles University Prague."},{"key":"55_CR9","doi-asserted-by":"crossref","unstructured":"Ogden W. \u2014 Ross R. \u2014 Winklmann An \u201cInterchange lemma\u201d for context-free languages, SIAM J. comp. Vol 15 No2 5\/1985.po","DOI":"10.1137\/0214031"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T20:12:26Z","timestamp":1626811946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0029646","relation":{},"subject":[]}}