Uniform Random Generation of Strings in a Context-Free Language
From MaRDI portal
Cited in
(25)- A new dichotomic algorithm for the uniform random generation of words in regular languages
- Random generation of trees and other combinatorial objects
- Simplifying regular expressions further
- Formulae and asymptotics for coefficients of algebraic functions
- Animaux et arbres guingois. (Animals and guingois trees)
- Random generation of words in an algebraic language in linear binary space
- Uniform random generation of expressions respecting algebraic identities
- Linear delay enumeration and monadic second-order logic
- Analytic models and ambiguity of context-free languages
- Generating words in a context-free language uniformly at random
- Uniform random generation of decomposable structures using floating-point arithmetic
- Random and uniform generation of words
- Hybrid one-dimensional reversible cellular automata are regular
- Uniform random generation of words of rational languages
- A random testing approach using pushdown automata
- Uniform generation of forests of restricted height
- Random Generation for Finitely Ambiguous Context-free Languages
- Ranking and unranking left szilard languages
- The random generation of underdiagonal walks
- Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation
- A linear algorithm for the random sampling from regular languages
- Directed column-convex polyominoes by recurrence relations
- Automatic average-case analysis of algorithms
- A calculus for the random generation of labelled combinatorial structures
- A quasi-polynomial-time algorithm for sampling words from a context-free language
This page was built for publication: Uniform Random Generation of Strings in a Context-Free Language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3036723)
