On the structure of linear apex NLC graph grammars

  title={On the structure of linear apex NLC graph grammars},
  author={Changwook Kim},
  journal={Theor. Comput. Sci.},
It is known that linear apex NLC (Lin-A-NLC) grammars can generate NP-complete graph languages. The present paper examines the source of this expressive power by analyzing complexity and decidability of the so-called k-connecting Lin-A-NLC (k-Lin-ANLC) grammars in which the right-hand side of each production contains at most k nodes that can be connected to outside nodes. The number of connecting nodes is indeed one source of the expressive power of graph grammars in that k-Lin-A-NLC ( (k + 1… CONTINUE READING