Boundary NLC and partition controlled graph grammars
- 1 January 1987
- book chapter
- Published by Springer Nature
- p. 593-609
- https://doi.org/10.1007/3-540-18771-5_78
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Some structural aspects of hypergraph languages generated by hyperedge replacementPublished by Springer Nature ,2005
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsingDiscrete Applied Mathematics, 1987
- Combinatorial properties of boundary NLC graph languagesDiscrete Applied Mathematics, 1987
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexityInformation and Control, 1986
- Graph theoretic closure properties of the family of boundary NLC graph languagesActa Informatica, 1986
- On the Set of all Subgraphs of the Graphs in a Boundary NLC Graph LanguagePublished by Springer Nature ,1986
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problemJournal of Algorithms, 1984
- Context-free grammars as a tool for describing polynomial-time subclasses of hard problemsInformation Processing Letters, 1982
- Restrictions, extensions, and variations of NLC grammarsInformation Sciences, 1980
- On the structure of node-label-controlled graph languagesInformation Sciences, 1980