Algorithms for equivalence and reduction to minimal form for a class of simple recursive equations
Abstract
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.
Domains
Computer Science [cs]
Fichier principal
From Semantics to Computer Science_ Essays in Honour of Gilles Kahn.pdf (224.57 Ko)
Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...