Computations by fly-automata beyond monadic second-order logic

Bruno Courcelle (1) , Irène Durand (2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 Méthodes Formelles

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.

Mots clés: XP algorithm; clique-width; monadic second-order logic; graph algorithm; fly-automaton; FPT algorithm

Domaines: Logique en informatique [cs.LO]

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