Elsevier

Theoretical Computer Science

Volume 88, Issue 1, 30 September 1991, Pages 139-150
Theoretical Computer Science

A regular characterization of graph languages definable in monadic second-order logic

https://doi.org/10.1016/0304-3975(91)90078-GGet rights and content
Under an Elsevier user license
open archive

Abstract

The class of monadic second-order definable graph languages is the smallest class containing certain elementary graph languages, and closed under the boolean set operations and under projections. This holds for many restricted types of graphs.

Cited by (0)