On the Courcelle Conjecture

Prelegent(ci)

Mikołaj Bojańczyk

Afiliacja

Uniwersytet Warszawski

Termin

16 marca 2016 14:15

Pokój

p. 5870

Tytuł w języku angielskim

joint work with Michał Pilipczuk

Seminarium

Seminarium „Teoria automatów”

---

We prove a conjecture of Courcelle, which states that a graph property is definable in mso with modular counting predicates on graphs of constant treewidth if, and only if it is recognizable in the following sense: constant-width tree decompositions of graphs satisfying the property can be recognized by tree automata.
While the forward implication is a classic fact known as Courcelle's theorem, the converse direction remained open.

---