The monadic second-order logic of graphs VII: graphs as relational structures
- 13 July 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 101 (1) , 3-33
- https://doi.org/10.1016/0304-3975(92)90148-9
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The monadic second-order logic of graphs V: on closing the gap between definability and recognizabilityTheoretical Computer Science, 1991
- The string generating power of context-free hypergraph grammarsJournal of Computer and System Sciences, 1991
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation and Computation, 1990
- A comparison of boundary graph grammars and context-free hypergraph grammarsInformation and Computation, 1990
- An axiomatic definition of context-free rewriting and its application to NLC graph grammarsTheoretical Computer Science, 1987
- Graph expressions and graph rewritingsTheory of Computing Systems, 1987
- Equivalences and transformations of regular systems—Applications to recursive program schemes and grammarsTheoretical Computer Science, 1986
- Transformations of structures: An algebraic approachTheory of Computing Systems, 1981
- Tree acceptors and some of their applicationsJournal of Computer and System Sciences, 1970