Combinatorial properties of boundary NLC graph languages
- 1 January 1987
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 16 (1) , 59-73
- https://doi.org/10.1016/0166-218x(87)90054-0
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- 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
- 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
- Restrictions on NLC graph grammarsTheoretical Computer Science, 1984
- Decision problems for node label controlled graph grammarsJournal of Computer and System Sciences, 1981
- Restrictions, extensions, and variations of NLC grammarsInformation Sciences, 1980
- On the structure of node-label-controlled graph languagesInformation Sciences, 1980
- Sur le coloriage des graphsColloquium Mathematicum, 1954