Regular expressions for tree-width 2 graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2022

Regular expressions for tree-width 2 graphs

Amina Doumane

Abstract

We propose a syntax of regular expressions, which describes languages of tree-width 2 graphs. We show that these languages correspond exactly to those languages of tree-width 2 graphs, definable in the counting monadic second-order logic (CMSO).

Keywords

Fichier principal
Vignette du fichier
LIPIcs-ICALP-2022-121.pdf (833.41 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-03753626 , version 1 (18-08-2022)

Identifiers

Cite

Amina Doumane. Regular expressions for tree-width 2 graphs. International Colloquium on Automata, Languages and Programming, Jul 2022, Paris, France. ⟨10.4230/LIPIcs.ICALP.2022.121⟩. ⟨hal-03753626⟩
11 View
11 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More