Analysis of functions with a finite number of return values

Paul Zimmermann 1
1 ALGO - Algorithms
Inria Paris-Rocquencourt
Abstract : 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
Type de document :
Rapport
[Research Report] RR-1625, INRIA. 1992
Liste complète des métadonnées

https://hal.inria.fr/inria-00074936
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 17:00:44
Dernière modification le : mardi 17 avril 2018 - 11:28:30
Document(s) archivé(s) le : dimanche 4 avril 2010 - 22:24:58

Fichiers

Identifiants

  • HAL Id : inria-00074936, version 1

Collections

Citation

Paul Zimmermann. Analysis of functions with a finite number of return values. [Research Report] RR-1625, INRIA. 1992. 〈inria-00074936〉

Partager

Métriques

Consultations de la notice

137

Téléchargements de fichiers

93