Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
