String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
- 31 January 1987
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 16 (1) , 17-30
- https://doi.org/10.1016/0166-218x(87)90051-5
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A pumping lemma for context-free graph languagesPublished by Springer Nature ,2005
- The computational complexity of certain graph grammarsPublished by Springer Nature ,2005
- Parsing of graphs in linear timePublished by Springer Nature ,2005
- Introduction to the algebraic theory of graph grammars (a survey)Published by Springer Nature ,2005
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexityInformation and Control, 1986
- Restrictions, extensions, and variations of NLC grammarsInformation Sciences, 1980
- On the structure of node-label-controlled graph languagesInformation Sciences, 1980
- 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