graph rewriting system 图形重写系统
term graph rewriting 长期图重写
parallel graph rewriting 并行图重写
parallel graph rewriting model 并行图重写执行模型
From the angle of implementation, we study the soundness and completeness of graph rewriting simulating term rewriting. In the no-cycle-appear case, graph rewriting is sound for all term rewriting.
图重写能够有效地实现项重写.文章从项重写的图实现的角度出发,研究了图重写模拟项重写的正确性和完备性;在无环出现的倩况下,图重写对一切项重写正确;在无环出现的条件下,图重写对左线性合流的项重写是完备的.据此,作者又研究了规则、共享和环生成的关系,从而指导操作,避免环的产生,保证正确性和完备性。
参考来源 - 项重写的图实现 in C·2,447,543篇论文数据,部分数据来源于NoteExpress
以上来源于: WordNet
应用推荐