Restrictions on NLC graph grammars
- 1 January 1984
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 31 (1-2) , 211-223
- https://doi.org/10.1016/0304-3975(84)90135-x
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Graph grammars with neighbourhood-controlled embeddingTheoretical Computer Science, 1982
- A characterization of context-free string languages by directed node-label controlled graph grammarsActa Informatica, 1981
- Restrictions, extensions, and variations of NLC grammarsInformation Sciences, 1980
- On the structure of node-label-controlled graph languagesInformation Sciences, 1980
- Deriving graphs from graphs by applying a productionActa Informatica, 1975
- A New Normal-Form Theorem for Context-Free Phrase Structure GrammarsJournal of the ACM, 1965
- On certain formal properties of grammarsInformation and Control, 1959