{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T21:04:54Z","timestamp":1773263094550,"version":"3.50.1"},"reference-count":22,"publisher":"EDP Sciences","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1051\/ita:2001128","type":"journal-article","created":{"date-parts":[[2003,11,14]],"date-time":"2003-11-14T15:11:23Z","timestamp":1068822683000},"page":"499-512","source":"Crossref","is-referenced-by-count":6,"title":["Random Generation for Finitely Ambiguous Context-free Languages"],"prefix":"10.1051","volume":"35","author":[{"given":"Alberto","family":"Bertoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimiliano","family":"Goldwurm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Santini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2002,7,15]]},"reference":[{"key":"R1","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA (1974)."},{"key":"R2","unstructured":"A.V. Aho and J.D. Ullman,The Theory of Parsing, Translation and Compiling - Vol. I: Parsing. Prentice Hall, Englewood Cliffs, NJ (1972)."},{"key":"R3","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/BF01275489","volume":"3","author":"Allender","year":"1993","journal-title":"Comput. Complexity"},{"key":"R4","unstructured":"F.-J. Brandenburg, On one-way auxiliary pushdown automata, edited by H. Waldschmidt, H. Tzschach and H.K.-G. Walter, inProc. of the 3rd GI Conference on Theoretical Computer Science. Springer, Darmstadt, FRG,Lecture Notes in Comput. Sci.48(1977) 132-144."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"N. Chomsky and M.-P. Sch\u00fctzenberger,The algebraic theory of context-free languages, edited by P. Braffort and D. Hirschberg. North-Holland, Amsterdam, The Netherlands,Computer Programming and Formal Systems(1963) 118-161.","DOI":"10.1016\/S0049-237X(08)72023-8"},{"key":"R6","first-page":"267","volume":"10","author":"Comtet","year":"1964","journal-title":"Enseign. Math."},{"key":"R7","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/321623.321625","volume":"18","author":"Cook","year":"1971","journal-title":"J. ACM"},{"key":"R8","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/S0304-3975(98)00323-5","volume":"218","author":"Denise","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"R9","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/362007.362035","volume":"13","author":"Earley","year":"1970","journal-title":"Commun. ACM"},{"key":"R10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(94)90226-7","volume":"132","author":"Flajolet","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"R11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(95)00025-8","volume":"54","author":"Goldwurm","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"R12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1006\/inco.1997.2621","volume":"134","author":"Gore","year":"1997","journal-title":"Inform. and Comput."},{"key":"R13","unstructured":"D.H. Greene and D.E. Knuth,Mathematics for the analysis of algorithms, Vol. 1. Birkh\u00e4user, Basel, CH,Progress in Comput. Sci.(1981)."},{"key":"R14","unstructured":"M.A. Harrison,Introduction to Formal Language Theory. Addison-Wesley, Reading, MA (1978)."},{"key":"R15","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1137\/0212044","volume":"12","author":"Hickey","year":"1963","journal-title":"SIAM J. Comput."},{"key":"R16","unstructured":"J.E. Hopcroft and J.D. Ullman,Introduction to Automata Theory, Language, and Computation. Addison-Wesley, Reading, MA (1979)."},{"key":"R17","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"Jerrum","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"R18","unstructured":"D.E. Knuth and A.C. Yao, The complexity of nonuniform random number generation, edited by J.F. Traub. Academic Press,Algorithms and Complexity: New Directions and Recent Results(1976) 357-428."},{"key":"R19","unstructured":"C. Lautemann, On pushdown and small tape, edited by K. Wagener,Dirk-Siefkes, zum 50. Geburststag (proceedings of a meeting honoring Dirk Siefkes on his fiftieth birthday). Technische Universit\u00e4t Berlin and Universit\u00e4t Ausgburg (1988) 42-47."},{"key":"R20","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0190(94)90033-7","volume":"49","author":"Mairson","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"R21","unstructured":"M. Santini,Random Uniform Generation and Approximate Counting of Combinatorial Structures, Ph.D. Thesis. Dipartimento di Scienze dell'Informazione (1999)."},{"key":"R22","doi-asserted-by":"crossref","unstructured":"A. Szepietowski,Turing Machines with Sublogarithmic Space. Springer Verlag,Lecture Notes in Comput. Sci.843(1994).","DOI":"10.1007\/3-540-58355-6"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2001128\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T13:17:38Z","timestamp":1682601458000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2001128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":22,"journal-issue":{"issue":"6"},"alternative-id":["ita02S8"],"URL":"https:\/\/doi.org\/10.1051\/ita:2001128","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}