Recursive queries and context-free graph grammars
- 21 January 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 78 (1), 217-244
- https://doi.org/10.1016/0304-3975(51)90009-6
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation and Computation, 1990
- Recursive query processing: the power of logicTheoretical Computer Science, 1989
- Translation of logic programs into functional fixpoint equationsTheoretical Computer Science, 1989
- 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
- A representation of graphs by algebraic expressions and its use for graph rewriting systemsLecture Notes in Computer Science, 1987
- Equivalences and transformations of regular systems—Applications to recursive program schemes and grammarsTheoretical Computer Science, 1986
- Fixed point theorems and semantics: a folk taleInformation Processing Letters, 1982
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976
- Algebraic automata and context-free setsInformation and Control, 1967