IANDC

2007

13 years 10 months ago
2007

A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...

JAPLL

2006

13 years 10 months ago
2006

A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...

JAPLL

2008

13 years 10 months ago
2008

A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique rep...

LATA

2009

Springer

14 years 4 months ago
2009

Springer

This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of ﬁnite graphs and graph transformations, in relation with the notions of tree-w...