The random generation of underdiagonal walks
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 52125 (Why is no real title available?)
- Asymptotic Methods in Enumeration
- Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem
- Motzkin numbers
- On context-free languages and push-down automata
- Uniform Random Generation of Strings in a Context-Free Language
Cited in
(12)- Probabilistic analysis of some (un)directed animals
- Linear-time generation of inhomogeneous random directed walks
- Uniform random generation of words of rational languages
- Random generation of words in an algebraic language in linear binary space
- Random and uniform generation of words
- Asymptotic properties of some underdiagonal walks generation algorithms
- The relevant prefixes of coloured Motzkin walks: an average case analysis
- Decomposition and group theoretic characterization of pairs of inverse relations of the Riordan type
- Efficient random sampling of binary and unary-binary trees via holonomic equations
- Complexity of anticipated rejection algorithms and the Darling-Mandelbrot distribution
- scientific article; zbMATH DE number 1552344 (Why is no real title available?)
- Riordan arrays and combinatorial sums
This page was built for publication: The random generation of underdiagonal walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893974)
