Regular expressions for languages of graphs of tree-width 2

Prelegent(ci)

Amina Doumane

Afiliacja

CNRS-ENS Lyon

Termin

9 czerwca 2021 14:15

Informacje na temat wydarzenia

online

Seminarium

Seminarium „Teoria automatów”

---

I propose a syntax of regular expressions which capture exactly CMSO definable languages of graphs of tree-width 2. A similar syntax is given for CMSO definable languages of series-parallel graphs and of connected tree-width 2 graphs.

---