Random generation of combinatorial structures from a uniform
Theoretical Computer Science
Monte-Carlo approximation algorithms for enumeration problems
Journal of Algorithms
The complexity of computing the number of strings of given length in context-free languages
Theoretical Computer Science
Generating words in a context-free language uniformly at random
Information Processing Letters
A calculus for the random generation of labelled combinatorial structures
Theoretical Computer Science
Random generation of words in an algebraic language in linear binary space
Information Processing Letters
The complexity of computing maximal word functions
Computational Complexity
A quasi-polynomial-time algorithm for sampling words from a context-free language
Information and Computation
Partial commutation and traces
Handbook of formal languages, vol. 3
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
An efficient context-free parsing algorithm
Communications of the ACM
The Book of Traces
Introduction to Formal Language Theory
Introduction to Formal Language Theory
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
On one-way auxiliary pushdown automata
Proceedings of the 3rd GI-Conference on Theoretical Computer Science
On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
This paper concerns the uniform random generation and the approximate counting of combinatorial structures admitting an ambiguous description. We propose a general framework to study the complexity of these problems and present some applications to specific classes of languages. In particular, we give a uniform random generation algorithm for finitely ambiguous context-free languages of the same time complexity of the best known algorithm for the unambiguous case. Other applications include a polynomial time uniform random generator and approximation scheme for the census function of (i) languages recognized in polynomial time by one-way nondeterministic auxiliary pushdown automata of polynomial ambiguity and (ii) polynomially ambiguous rational trace languages.