scientific article; zbMATH DE number 1552330
From MaRDI portal
Publication:4524575
Recommendations
- Generating words in a context-free language uniformly at random
- Random generation of words in an algebraic language in linear binary space
- Random Generation for Finitely Ambiguous Context-free Languages
- A quasi-polynomial-time algorithm for sampling words from a context-free language
- Multi-dimensional Boltzmann sampling of languages
Cited in
(15)- A quasi-polynomial-time algorithm for sampling words from a context-free language
- On the number of occurrences of a symbol in words of regular languages.
- Random and uniform generation of words
- A linear algorithm for the random sampling from regular languages
- Multi-dimensional Boltzmann sampling of languages
- On the properties of a stochastic context-free language generated by a grammar with two classes of nonterminal symbols
- Random Generation for Finitely Ambiguous Context-free Languages
- scientific article; zbMATH DE number 3921975 (Why is no real title available?)
- Non-redundant random generation algorithms for weighted context-free grammars
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
- Local limit laws for symbol statistics in bicomponent rational models
- Analysis of the rate functions of large deviations for symbol statistics
- Large deviation properties for pattern statistics in primitive rational models
- Controlled non-uniform random generation of decomposable structures
- Comparing consecutive letter counts in multiple context-free languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4524575)
