作者: Bruno Courcelle , Joost Engelfriet , Grzegorz Rozenberg
DOI: 10.1016/0022-0000(93)90004-G
关键词:
摘要: Abstract We introduce the handle-rewriting hypergraph grammars (HH grammars), based on replacement of handles, i.e., subhypergraphs consisting one hyperedge together with its incident vertices. This extends replacement, where only is replaced. A HH grammar separated (an S-HH grammar) if nonterminal handles do not overlap. The are context-free, and sets they generate can be characterized as least solutions certain systems equations. They same graphs NLC-like vertex-rewriting C-edNCE graph that also context-free.