Algorithms for equivalence and reduction to minimal form for a class of simple recursive equations - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 1974

Algorithms for equivalence and reduction to minimal form for a class of simple recursive equations

Résumé

Foreword This document presents a translation for historical perspective of the paper: " B. Courcelle, G. Kahn, and J. Vuillemin. Algorithmes d'´ equivalence et de réduction a des expressions minimales dans une classe d'´ equations récursives simples, in, Jacques Loeckx, editor, Automata, Languages and Programming, volume Abstract In this paper, we describe an algorithm for deciding equivalence in a domain whose objects are defined by uninterpreted fixpoint equations. The algorithm is then applied to finding minimal representations of those objects.
Fichier principal
Vignette du fichier
From Semantics to Computer Science_ Essays in Honour of Gilles Kahn.pdf (224.57 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01239749 , version 1 (15-12-2015)

Identifiants

Citer

Bruno Courcelle, Gilles Kahn, Jean Vuillemin. Algorithms for equivalence and reduction to minimal form for a class of simple recursive equations. Yves Bertot; Gérard Huet; Jean-Jacques Lévy; Gordon Plotkin. From Semantics to Computer Science Essays in Honour of Gilles Kahn, Cambridge University Press 1974, From Semantics to Computer Science Essays in Honour of Gilles Kahn, 9780521518253. ⟨10.1017/CBO9780511770524.009⟩. ⟨hal-01239749⟩
75 Consultations
136 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More