Linear graph grammar

In computer science, a linear graph grammar (also a connection graph reduction system or a port graph grammar) is a class of graph grammar on which… (More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
A grammar is nonterminal bounded, with bound S if each of its sentential forms contains at most k nonterminals. In case k = 1… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?