Rapport (Rapport De Recherche) Année : 1992

Analysis of functions with a finite number of return values

Paul Zimmermann

Résumé

A class of functions with a finite number of return values is defined over combinatorial structures. We prove that the characterization of combinatorial structures by such a function is equivalent to a set of grammar productions and we show how to derive these productions from the body of the function. In the field of automatic average case analysis, this result allows the use of functions, which makes the description of algorithms more natural and smaller

Domaines

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

Dates et versions

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

Licence

Identifiants

  • HAL Id : inria-00074936 , version 1

Citer

Paul Zimmermann. Analysis of functions with a finite number of return values. [Research Report] RR-1625, INRIA. 1992. ⟨inria-00074936⟩
169 Consultations
241 Téléchargements

Partager

  • More