Rapport (Rapport De Recherche) Année : 1999

On Generating Functions of Generating Trees

Résumé

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.

Domaines

Fichier principal
Vignette du fichier
RR-3661.pdf (432.23 Ko) Télécharger le fichier

Dates et versions

inria-00073011 , version 1 (24-05-2006)

Licence

Identifiants

  • HAL Id : inria-00073011 , version 1

Citer

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⟩
181 Consultations
311 Téléchargements

Partager

  • More