Regular expressions for tree-width 2 graphs
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).
Domains
Computer Science [cs]
Origin : Publisher files allowed on an open archive