Random Generation for Finitely Ambiguous Context-free Languages
From MaRDI portal
Publication:3147017
DOI10.1051/ITA:2001128zbMATH Open1005.68091OpenAlexW2093299596MaRDI QIDQ3147017FDOQ3147017
Massimo Santini, Alberto Bertoni, Massimiliano Goldwurm
Publication date: 18 September 2002
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2001__35_6_499_0
Recommendations
- scientific article; zbMATH DE number 3921975
- Finite generation of ambiguity in context-free languages
- scientific article; zbMATH DE number 1688372
- Random generation of DFAs
- Random Generation of Combinatorial Structures using Context-Fee Grammars
- Generating words in a context-free language uniformly at random
- Pseudorandom generators against advised context-free languages
- Non-redundant random generation algorithms for weighted context-free grammars
- Random generation of nondeterministic finite-state tree automata
- scientific article; zbMATH DE number 1552330
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Random generation of combinatorial structures from a uniform distribution
- An efficient context-free parsing algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Turing machines with sublogarithmic space
- Calcul pratique des coefficients de Taylor d'une fonction algébrique
- Optimization of LR(k) parsers
- Title not available (Why is that?)
- A calculus for the random generation of labelled combinatorial structures
- A quasi-polynomial-time algorithm for sampling words from a context-free language
- Uniform random generation of decomposable structures using floating-point arithmetic
- Uniform Random Generation of Strings in a Context-Free Language
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- Random generation of words in an algebraic language in linear binary space
- The complexity of computing maximal word functions
- Title not available (Why is that?)
- Generating words in a context-free language uniformly at random
Cited In (12)
- Title not available (Why is that?)
- Linear delay enumeration and monadic second-order logic
- Generating words in a context-free language uniformly at random
- Random Generation of Combinatorial Structures using Context-Fee Grammars
- On the number of occurrences of a symbol in words of regular languages.
- Title not available (Why is that?)
- Formulae and Asymptotics for Coefficients of Algebraic Functions
- A linear algorithm for the random sampling from regular languages
- Random generation of DFAs
- Bounded length UCFG equivalence
- Preface
- Title not available (Why is that?)
This page was built for publication: Random Generation for Finitely Ambiguous Context-free Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147017)
