Generating functions for generating trees
<|reference_start|>Generating functions for generating trees: Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the object. Generating trees lead to a fast computation of enumeration sequences (sometimes, to explicit formulae as well) and provide efficient random generation algorithms. We investigate the links between the structural properties of the rewriting rules defining such trees and the rationality, algebraicity, or transcendence of the corresponding generating function.<|reference_end|>
@article{banderier2004generating,
    title={Generating functions for generating trees},
    author={Cyril Banderier (LIPN, ALGO UR-R), Philippe Flajolet (ALGO UR-R),
  Daniele Gardy (PRISM), Mireille Bousquet-Melou (LABRI), Alain Denise (LRI),
  Dominique Gouyou-Beauchamps (LRI)},
    journal={Discrete Mathematics 246 (1-3) (2002) 29-55},
    year={2004},
    doi={10.1016/S0012-365X(01)00250-3},
    archivePrefix={arXiv},
    eprint={math/0411250},
    primaryClass={math.CO cs.DM cs.DS}
}