Skip to main content
Conference Proceedings

A characterization of context-free NCE graph languages by monadic second-order logic on trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1991) 532 LNCS 311-327
DOI: 10.1007/BFb0017397
22Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A graph language L is in the class C-edNCE of context-free NCE graph languages if and only if L = f(T) where f is a function on graphs that can be defined in monadic second-order logic and T is the set of’all trees over some ranked alphabet. This logical characterization implies a large number of closure and decidability properties of the class C-edNCE.

Author supplied keywords

Cite

CITATION STYLE

APA

Engelfriet, J. (1991). A characterization of context-free NCE graph languages by monadic second-order logic on trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 532 LNCS, pp. 311–327). Springer Verlag. https://doi.org/10.1007/BFb0017397

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free