Random Generation for Finitely Ambiguous Context-free Languages

We prove that a word of length n from a finitely ambiguous context-free language can be generated at random under uniform distribution in O (n 2 log n ) time by a probabilistic random access machine assuming a logarithmic cost criterion. We also show that the same problem can be solved in polynomial time for every language accepted by a polynomial time 1 -NAuxPDA with polynomially bounded ambiguity.

[1]  Harry G. Mairson.  Generating Words in a Context-Free Language Uniformly at Random , 1994, Inf. Process. Lett..

[2]  Jacques Cohen,et al.  Uniform Random Generation of Strings in a Context-Free Language , 1983, SIAM J. Comput..

[3]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[4]  Massimiliano Goldwurm,et al.  Random Generation of Words in an Algebraic Language in Linear Binary Space , 1995, Inf. Process. Lett..

[5]  Andrew Chi-Chih Yao,et al.  The complexity of nonuniform random number generation , 1976 .

[6]  Andrzej Szepietowski.  Turing Machines with Sublogarithmic Space , 1994, Lecture Notes in Computer Science.

[7]  D. Knuth,et al.  Mathematics for the Analysis of Algorithms , 1999 .

[8]  Sampath Kannan,et al.  A Quasi-Polynomial-Time Algorithm for Sampling Words from a Context-Free Language , 1997, Inf. Comput..

[9]  Franz-Josef Brandenburg.  On one-way auxiliary pushdown automata , 1977, Theoretical Computer Science.

[10]  Alain Denise,et al.  Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic , 1999, Theor. Comput. Sci..

[11]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[12]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[13]  Stephen A. Cook,et al.  Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.

[14]  Michael A. Arbib,et al.  An Introduction to Formal Language Theory , 1988, Texts and Monographs in Computer Science.

[15]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[16]  Noam Chomsky,et al.  The Algebraic Theory of Context-Free Languages* , 1963 .

[17]  Philippe Flajolet,et al.  A Calculus for the Random Generation of Labelled Combinatorial Structures , 1994, Theor. Comput. Sci..

[18]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[19]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.