Skip to search form
Skip to main content
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…
Confluence (abstract rewriting)
Semantic Scholar uses AI to extract papers important to this topic.
Nonterminal Bounded NLC Graph Grammars
Theor. Comput. Sci.
A grammar is nonterminal bounded, with bound S if each of its sentential forms contains at most k nonterminals. In case k = 1…
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Terms of Service
ACCEPT & CONTINUE