{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:57Z","timestamp":1725490257374},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_61","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T01:32:38Z","timestamp":1188351158000},"page":"703-714","source":"Crossref","is-referenced-by-count":3,"title":["Characterization of Context-Free Languages with Polynomially Bounded Ambiguity"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Wich","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"61_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and context-free languages","author":"J. Berstel","year":"1979","unstructured":"J. Berstel. Transductions and context-free languages. Teubner, Stuttgart, 1979."},{"key":"61_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/3-540-46541-3_47","volume-title":"Proc. STACS 2000","author":"A. Bertoni","year":"2000","unstructured":"A. Bertoni, M. Goldwurm, and M. Santini. Random generation and approximate counting of ambiguously described combinatorical structures. In H. Reichel and S. Tison, editors, Proc. STACS 2000, LNCS 1770, pp. 567\u2013580, Berlin-Heidelberg-New York, 2000. Springer."},{"key":"61_CR3","first-page":"377","volume-title":"Automata, Languages and Programming","author":"J. Crestin","year":"1973","unstructured":"J. Crestin. Un langage non ambigu dont le carr\u00e9 est d\u2019ambiguit\u00e9 non born\u00e9e. In M. Nivat, editor, Automata, Languages and Programming, pp. 377\u2013390. Amsterdam, North-Holland, 1973."},{"unstructured":"J. C. Earley. An efficient context-free parsing algorithm. PhD thesis, Carnegie-Mellon Uni., 1968.","key":"61_CR4"},{"key":"61_CR5","volume-title":"Introduction to Formal Language Theory","author":"M. A. Harrison","year":"1978","unstructured":"M. A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, 1978."},{"unstructured":"H. Maurer. The existence of context-free languages which are inherently ambiguous of any degree. Research series, Dept. of Mathematics, Uni. of Calgary, 1968.","key":"61_CR6"},{"unstructured":"M. Naji. Grad der Mehrdeutigkeit kontextfreier Grammatiken und Sprachen, 1998. Diplomarbeit, FB Informatik, JWG-Universit\u00e4t Frankfurt\/M.","key":"61_CR7"},{"key":"61_CR8","first-page":"199","volume":"60","author":"R. J. Parikh","year":"1961","unstructured":"R. J. Parikh. Language-generating devices. In Quarterly Progress Report, volume 60, pp. 199\u2013212. Research Laboratory of Electronics, M. I.T, 1961.","journal-title":"Quarterly Progress Report"},{"doi-asserted-by":"crossref","unstructured":"A. Salomaa and M. Soittola. Automata theoretic aspects of formal power series. Springer, 1978.","key":"61_CR9","DOI":"10.1007\/978-1-4612-6264-0"},{"unstructured":"K. Wich. Kriterien f\u00fcr die Mehrdeutigkeit kontextfreier Grammatiken, 1997. Diplomarbeit, FB Informatik, JWG-Universit\u00e4t Frankfurt\/M.","key":"61_CR10"},{"key":"61_CR11","first-page":"125","volume-title":"Proc. DLT, 1999","author":"K. Wich","year":"2000","unstructured":"K. Wich. Exponential ambiguity of context-free grammars. In G. Rozenberg and W. Thomas, editors, Proc. DLT, 1999, pp. 125\u2013138. World Scientific, Singapore, 2000."},{"key":"61_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1007\/3-540-44612-5_64","volume-title":"Proc. MFCS 2000","author":"K. Wich","year":"2000","unstructured":"K. Wich. Sublinear ambiguity. In M. Nielsen and B. Rovan, editors, Proc. MFCS 2000, LNCS 1893, pp. 690\u2013698, Berlin-Heidelberg-New York, 2000. Springer."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T08:32:46Z","timestamp":1550910766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_61","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}