An axiomatic definition of context-free rewriting and its application to NLC graph grammars
Open Access
- 31 December 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 55 (2-3), 141-181
- https://doi.org/10.1016/0304-3975(87)90102-2
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Graph expressions and graph rewritingsTheory of Computing Systems, 1987
- Neighborhood-uniform NLC grammarsComputer Vision, Graphics, and Image Processing, 1986
- Graph theoretic closure properties of the family of boundary NLC graph languagesActa Informatica, 1986
- Equivalences and transformations of regular systems—Applications to recursive program schemes and grammarsTheoretical Computer Science, 1986
- Decision problems for node label controlled graph grammarsJournal of Computer and System Sciences, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- IO and OI. IIJournal of Computer and System Sciences, 1978
- IO and OI. IJournal of Computer and System Sciences, 1977
- Algebraic automata and context-free setsInformation and Control, 1967
- Two Families of Languages Related to ALGOLJournal of the ACM, 1962