Infinite transducers on terms denoting graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Infinite transducers on terms denoting graphs

Résumé

Starting from Courcelle's theorem which connects the problem of verifying properties of graphs of bounded clique-width with term automata, we have developed the Autograph Lisp library, itself based on the Autowrite Lisp library, which provides automata for verifying graph properties. Because most of these automata are huge, fly automata have been introduced in the underlying library Autowrite and have become the default type of automata. By default, the operations on automata are now performed on fly automata. This article shows how fly automata can be generalized to attributed fly automata and finally to transducers. We apply these concepts in the domain of graph theory. We present some computations performed by transducers on terms representing graphs. This transducer approach for computing graph values is an alternative to the classical algorithms of graph theory.
Fichier non déposé

Dates et versions

hal-00829088 , version 1 (02-06-2013)

Identifiants

  • HAL Id : hal-00829088 , version 1

Citer

Bruno Courcelle, Irène Durand. Infinite transducers on terms denoting graphs. European Lisp Symposium, Jun 2013, Madrid, Spain. pp.47-58. ⟨hal-00829088⟩

Collections

CNRS
149 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More