Decision problems for node label controlled graph grammars
作者：
Highlights：
•
摘要
Two basic techniques are presented to show the decidability status of a number of problems concerning node label controlled graph grammars. Most of the problems are of graph-theoretic nature and concern topics like planarity, connectedness and bounded degreeness of graph languages.
论文关键词：
论文评审过程：Received 25 October 1979, Available online 2 December 2003.
论文官网地址：https://doi.org/10.1016/0022-0000(81)90025-8
