The bounded degree problem for NLC grammars is decidable
- 1 December 1986
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 33 (3) , 415-422
- https://doi.org/10.1016/0022-0000(86)90060-7
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Decision problems for node label controlled graph grammarsJournal of Computer and System Sciences, 1981
- 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
- Etol-grammars and N-grammarsInformation Processing Letters, 1975