Skip to Main content Skip to Navigation
New interface
Reports (Research report)

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.
Document type :
Reports (Research report)
Complete list of metadata
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 11:35:06 AM
Last modification on : Wednesday, October 26, 2022 - 8:16:44 AM
Long-term archiving on: : Thursday, March 24, 2011 - 12:25:23 PM


  • HAL Id : inria-00073011, version 1



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⟩



Record views


Files downloads