A pumping lemma for context-free graph languages
- 19 November 2005
- book chapter
- Published by Springer Nature
- p. 270-283
- https://doi.org/10.1007/bfb0025726
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Graph-Ersetzungssysteme für AnwendungenPublished by Springer Nature ,1979
- Context-free graph grammarsInformation and Control, 1978
- A class of linearly parsable graph grammarsActa Informatica, 1978
- Pair grammars, graph languages and string-to-graph translationsJournal of Computer and System Sciences, 1971