Pages that link to "Item:Q1318776"
From MaRDI portal
The following pages link to Generating words in a context-free language uniformly at random (Q1318776):
Displaying 19 items.
- A new dichotomic algorithm for the uniform random generation of words in regular languages (Q391418) (← links)
- Non-redundant random generation algorithms for weighted context-free grammars (Q391421) (← links)
- Random generation of words in an algebraic language in linear binary space (Q673672) (← links)
- Linear delay enumeration and monadic second-order logic (Q967312) (← links)
- Uniform random generation of decomposable structures using floating-point arithmetic (Q1292294) (← links)
- Uniform random generation of words of rational languages (Q1351211) (← links)
- A quasi-polynomial-time algorithm for sampling words from a context-free language (Q1363787) (← links)
- Generating random binary trees -- a survey (Q1818783) (← links)
- Random and uniform generation of words (Q1917516) (← links)
- A linear algorithm for the random sampling from regular languages (Q2428675) (← links)
- On the average state complexity of partial derivative automata: an analytic combinatorics approach (Q2909097) (← links)
- Random Generation for Finitely Ambiguous Context-free Languages (Q3147017) (← links)
- ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED (Q3395137) (← links)
- Antimirov and Mosses’s Rewrite System Revisited (Q3602800) (← links)
- (Q3696515) (← links)
- Ranking and unranking left szilard languages (Q4392895) (← links)
- Left is Better Than Right for Reducing Nondeterminism of NFAs (Q6114834) (← links)
- Location automata for regular expressions with shuffle and intersection (Q6186310) (← links)
- Bounded length UCFG equivalence (Q6487444) (← links)
