Skip to main content
Conference Proceedings

Hierarchical graph decompositions defined by grammars and logical formulas

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1631 90-91
DOI: 10.1007/3-540-48685-2_7
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A context-free grammar specifies a set of words, and for each of these words one or more derivation trees. Such a tree represents the (or a) hierarchical structure of the corresponding word and is the input of algorithms like those used in a compiler.

Cite

CITATION STYLE

APA

Courcelle, B. (1999). Hierarchical graph decompositions defined by grammars and logical formulas. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1631, pp. 90–91). Springer Verlag. https://doi.org/10.1007/3-540-48685-2_7

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