Special tree-width and the verification of monadic second-order graph pr operties
Résumé
Automata for checking monadic second-order graph properties with edge quantifications are easy to construct for graphs of bounded special tree-width