Functional Equations for Data Structures
    
    
  
  
  
      
      
      
        
Séminaire lotharingien de combinatoire, Tome 18 (1987)
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website
            
              We show how tree-like structures (B-trees, AVL trees, binary trees, etc. ...) can be characterized by functional equations in the context of the theory of species of structures which has been introduced as a conceptual framework for enumerative combinatorics. The generating functions associated to these abstract data structures are directly derived from the corresponding functional equations.  
        
      
The paper has been finally published under the same title in STACS 88 (Bordeaux, 1988), pp. 73-80, Lecture Notes in Comput. Sci., 294, Springer, Berlin, 1988.
@article{SLC_1987_18_a6,
     author = {Francois Bergeron and Gilbert Labelle and Pierre Leroux},
     title = {Functional {Equations} for {Data} {Structures}},
     journal = {S\'eminaire lotharingien de combinatoire},
     publisher = {mathdoc},
     volume = {18},
     year = {1987},
     url = {http://geodesic.mathdoc.fr/item/SLC_1987_18_a6/}
}
                      
                      
                    Francois Bergeron; Gilbert Labelle; Pierre Leroux. Functional Equations for Data Structures. Séminaire lotharingien de combinatoire, Tome 18 (1987). http://geodesic.mathdoc.fr/item/SLC_1987_18_a6/
