The string generating power of context-free hypergraph grammars
- 1 October 1991
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 43 (2), 328-360
- https://doi.org/10.1016/0022-0000(91)90018-z
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- 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
- Linear graph grammars: Power and complexityInformation and Computation, 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
- Relational data base design using refinement rulesRAIRO. Informatique théorique, 1983
- Passes and paths of attribute grammarsInformation and Control, 1981
- Tree transducers, L systems, and two-way machinesJournal of Computer and System Sciences, 1980
- One way finite visit automataTheoretical Computer Science, 1978
- Translations on a context free grammarInformation and Control, 1971