Graph grammars based on node rewriting: an introduction to NLC graph grammars
- 22 November 2005
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- On polynomial time graph grammarsPublished by Springer Nature ,2006
- Complexity of boundary graph languagesRAIRO - Theoretical Informatics and Applications, 1990
- Linear graph grammars: Power and complexityInformation and Computation, 1989
- Context-free NCE graph grammarsLecture Notes in Computer Science, 1989
- Nonterminal bounded NLC graph grammarsTheoretical Computer Science, 1988
- An axiomatic definition of context-free rewriting and its application to NLC graph grammarsTheoretical Computer Science, 1987
- On partially ordered graph grammarsPublished by Springer Nature ,1987
- On the membership problem for regular DNLC grammarsDiscrete Applied Mathematics, 1986
- Traces, dependency graphs and DNLC grammarsDiscrete Applied Mathematics, 1985
- Restrictions on NLC graph grammarsTheoretical Computer Science, 1984