The random generation of directed animals

DOI10.1016/0304-3975(94)90046-9zbMath0938.68935OpenAlexW2061847193MaRDI QIDQ1342241

Renzo Pinzani, Renzo Sprugnoli, Elena Barcucci

Publication date: 9 February 1995

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90046-9

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Animaux et arbres guingois. (Animals and guingois trees)
• Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem
• Binary search networks: A new method for key searching
• On context-free languages and push-down automata
• Motzkin numbers

Related Items (12)

Riordan arrays and combinatorial sums ⋮ Uniform generation of a Motzkin word ⋮ Complexity of anticipated rejection algorithms and the Darling-Mandelbrot distribution ⋮ A parallel algorithm for the generation of a permutation and applications ⋮ ``Deco polyominoes, permutations and random generation ⋮ Random and uniform generation of words ⋮ Unnamed Item ⋮ Non-uniform random generation of generalized Motzkin paths ⋮ Schröder's paths and random hierarchies ⋮ Exhaustive generation of some lattice paths and their prefixes ⋮ Generating random binary trees -- a survey ⋮ Basic analytic combinatorics of directed lattice paths

This page was built for publication: The random generation of directed animals