Context-Free Graph Grammars
Author:
- Joost EngelfrietJEJoost Engelfriet
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 125-213
Abstract
No abstract availableKeywords
This publication has 58 references indexed in Scilit:
- A logical characterization of the sets of hypergraphs defined by Hyperedge Replacement grammarsTheory of Computing Systems, 1995
- Domino treewidth1995
- Handle-rewriting hypergraph grammarsJournal of Computer and System Sciences, 1993
- Monadic second-order evaluations on tree-decomposable graphsTheoretical Computer Science, 1993
- The equivalence of boundary and confluent graph grammars on graph languages of bounded degreeLecture Notes in Computer Science, 1991
- Graph expressions and graph rewritingsTheory of Computing Systems, 1987
- An axiomatic definition of context-free rewriting and its application to NLC graph grammarsTheoretical Computer Science, 1987
- Complement reducible graphsDiscrete Applied Mathematics, 1981
- Transductions and Context-Free Languages1979
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960