Handle-rewriting hypergraph grammars
- 1 April 1993
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 46 (2), 218-270
- https://doi.org/10.1016/0022-0000(93)90004-g
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A characterization of context-free NCE graph languages by monadic second-order logic on treesPublished by Springer Nature ,2005
- Context-free handle-rewriting hypergraph grammarsPublished by Springer Nature ,2005
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issuesRAIRO - Theoretical Informatics and Applications, 1992
- The string generating power of context-free hypergraph grammarsJournal of Computer and System Sciences, 1991
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation 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
- On partially ordered graph grammarsPublished by Springer Nature ,1987
- Equivalences and transformations of regular systems—Applications to recursive program schemes and grammarsTheoretical Computer Science, 1986
- Complement reducible graphsDiscrete Applied Mathematics, 1981