Complexity of boundary graph languages
Open Access
- 1 January 1990
- journal article
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 24 (3) , 267-274
- https://doi.org/10.1051/ita/1990240302671
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- A comparison of boundary graph grammars and context-free hypergraph grammarsInformation and Computation, 1990
- Linear graph grammars: Power and complexityInformation and Computation, 1989
- Efficient algorithms on context-free graph languagesPublished by Springer Nature ,1988
- Boundary NLC and partition controlled graph grammarsPublished by Springer Nature ,1987
- Apex graph grammarsPublished by Springer Nature ,1987
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexityInformation and Control, 1986
- Graph grammars with neighbourhood-controlled embeddingTheoretical Computer Science, 1982
- On sequential and parallel node-rewriting graph grammarsComputer Graphics and Image Processing, 1982
- Tree-size bounded alternationJournal of Computer and System Sciences, 1980
- On the structure of node-label-controlled graph languagesInformation Sciences, 1980