Context-free handle-rewriting hypergraph grammars
- 22 November 2005
- book chapter
- Published by Springer Nature
- p. 253-268
- https://doi.org/10.1007/bfb0017394
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- On polynomial time graph grammarsPublished by Springer Nature ,2006
- Some structural aspects of hypergraph languages generated by hyperedge replacementPublished by Springer Nature ,2005
- 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
- Context-free NCE graph grammarsLecture Notes in 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
- Equivalences and transformations of regular systems—Applications to recursive program schemes and grammarsTheoretical Computer Science, 1986
- On the structure of node-label-controlled graph languagesInformation Sciences, 1980