论文标题
重写系统，普通组和大地图
Rewriting systems, plain groups, and geodetic graphs
论文作者
论文摘要
我们证明了一个组由有限收敛长度减少的重写系统提出，其中每个规则的长度为3的左侧是且仅当组是普通的。我们的证明是通过新的结果进行的，该结果涉及大地图中嵌入式电路的性质，这可能对图理论具有独立感兴趣。
We prove that a group is presented by finite convergent length-reducing rewriting systems where each rule has left-hand side of length 3 if and only if the group is plain. Our proof goes via a new result concerning properties of embedded circuits in geodetic graphs, which may be of independent interest in graph theory.
