Context-free NCE graph grammars
- 1 January 1989
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 148-161
- https://doi.org/10.1007/3-540-51498-8_15
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- On polynomial time graph grammarsPublished by Springer Nature ,2006
- 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
- On partially ordered graph grammarsPublished by Springer Nature ,1987
- Graph-Grammars and Their Application to Computer SciencePublished by Springer Nature ,1987
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexityInformation and Control, 1986
- Complement reducible graphsDiscrete Applied Mathematics, 1981
- Tree transducers, L systems, and two-way machinesJournal of Computer and System Sciences, 1980
- Graph-GrammatikenPublished by Springer Nature ,1979