On context-free graph languages generated by edge replacement
- 5 October 2005
- book chapter
- Published by Springer Nature
- p. 143-158
- https://doi.org/10.1007/bfb0000104
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A pumping lemma for context-free graph languagesPublished by Springer Nature ,2005
- A tutorial and bibliographical survey on graph grammarsPublished by Springer Nature ,2005
- Introduction to the algebraic theory of graph grammars (a survey)Published by Springer Nature ,2005
- On the structure of node-label-controlled graph languagesInformation Sciences, 1980
- Context-free graph grammarsInformation and Control, 1978
- Graph grammars and global program data flow analysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1976
- A characterization of context-free languagesJournal of Computer and System Sciences, 1971
- Cap expressions for context-free languagesInformation and Control, 1971
- Transition network grammars for natural language analysisCommunications of the ACM, 1970
- Two Families of Languages Related to ALGOLJournal of the ACM, 1962