Random generation of trees and other combinatorial objects

DOI10.1016/S0304-3975(98)00322-3zbMath0916.68124OpenAlexW2008516236MaRDI QIDQ1292293

Elena Barcucci, Elisa Pergola, Alberto del Lungo

Publication date: 21 June 1999

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00322-3

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (9)

From object grammars to ECO systems ⋮ A linear algorithm for the random sampling from regular languages ⋮ Production matrices and riordan arrays ⋮ Mixed succession rules: the commutative case ⋮ Production matrices ⋮ A general exhaustive generation algorithm for Gray structures ⋮ The relevant prefixes of coloured Motzkin walks: an average case analysis ⋮ On the equivalence problem for succession rules ⋮ Efficient iteration in admissible combinatorial classes

Cites Work

• Unnamed Item
• Generating binary trees with uniform probability
• A method and two algorithms on the theory of partitions
• A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
• Enumerating \(k\)-way trees
• A calculus for the random generation of labelled combinatorial structures
• Nondecreasing Dyck paths and \(q\)-Fibonacci numbers
• A methodology for plane tree enumeration
• Uniform Random Generation of Strings in a Context-Free Language
• Random generation of colored trees
• Some permutations with forbidden subsequences and their inversion number

This page was built for publication: Random generation of trees and other combinatorial objects