论文标题
旅行者财产的伪造意味着地球自动扫描性
The falsification by fellow traveler property implies geodesic autostackability
论文作者
论文摘要
众所周知，有旅行者财产伪造的伪造的群体具有可解决的单词问题，但众所周知，它们是自动的或具有有限的收敛重写系统。在本文中，我们表明这些群体承认了这两个属性的概括。也就是说，它们在地理上是可以自动储存的。作为证明这一点的关键部分，我们表明，一个更宽的组，即具有同步定期收敛前缀练习系统的重量非侵入的组，具有有限的常规收敛前缀融合系统。
Groups with the falsification by fellow traveler property are known to have solvable word problem, but they are not known to be automatic or to have finite convergent rewriting systems. In this paper, we show that these groups admit a generalization of the two properties; namely, they are geodesically autostackable. As a key part of proving this, we show that a wider class of groups, namely groups with a weight non-increasing synchronously regular convergent prefix-rewriting system, have a bounded regular convergent prefix-rewriting system.
