On Generating Functions of Generating Trees

Abstract : Generating trees describe conveniently certain families of combinatorial objects: 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) while providing efficient random generation algorithms. In this paper, we investigate the relationship between structural properties of the rules defining such trees and the rationality, algebraicity, or transcendence of the corresponding generating functions.
Type de document :
Rapport
[Research Report] RR-3661, INRIA. 1999
Liste complète des métadonnées

https://hal.inria.fr/inria-00073011
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 11:35:06
Dernière modification le : samedi 17 septembre 2016 - 01:35:45
Document(s) archivé(s) le : jeudi 24 mars 2011 - 12:25:23

Fichiers

Identifiants

  • HAL Id : inria-00073011, version 1

Collections

Citation

Cyril Banderier, Mireille Bousquet-Mélou, Alain Denise, Philippe Flajolet, Danièle Gardy, et al.. On Generating Functions of Generating Trees. [Research Report] RR-3661, INRIA. 1999. 〈inria-00073011〉

Partager

Métriques

Consultations de la notice

111

Téléchargements de fichiers

96