Computations by fly-automata beyond monadic second-order logic

Bruno Courcelle 1 Irène Durand 2
2 Méthodes Formelles
LaBRI - Laboratoire Bordelais de Recherche en Informatique
Abstract : We present logically based methods for constructing XP and FPT graph algorithms, parametrized by tree-width or clique-width. We will use fly-automata introduced in a previous article. They make possible to check properties that are not monadic second-order expressible because their states may include counters, so that their sets of states may be infinite. We equip these automata with output functions, so that they can compute values associated with terms or graphs. Rather than new algorithmic results we present tools for constructing easily certain dynamic programming algorithms by combining predefined automata for basic functions and properties.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2016, 619, pp.32-67
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-00828211
Contributeur : Bruno Courcelle <>
Soumis le : mardi 8 décembre 2015 - 10:46:58
Dernière modification le : jeudi 7 avril 2016 - 11:03:06
Document(s) archivé(s) le : mercredi 9 mars 2016 - 13:19:42

Fichiers

FlyAutFINAL.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00828211, version 2
  • ARXIV : 1305.7120

Collections

Citation

Bruno Courcelle, Irène Durand. Computations by fly-automata beyond monadic second-order logic. Theoretical Computer Science, Elsevier, 2016, 619, pp.32-67. <hal-00828211v2>

Partager

Métriques

Consultations de
la notice

98

Téléchargements du document

46