Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width.

Denis Lapoire

Browse the full STACS paper archive.