arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/9805057math.GR
收藏

Automatic Groups and Knuth-Bendix with Infinitely Many Rules

D. B. A. Epstein, Paul J. Sanders

英文摘要:

It is shown how to use a small finite state automaton in two variables in order to carry out part of the Knuth--Bendix process for rewriting words in a group. The main objective is to provide a substitute for the most space-demanding module of the existing software which attempts to find a shortlex-automatic structure for a group. The two-variable automaton can be used to store an infinite set of rules and to carry out fast reduction of arbitrary words using this infinite set. We introduce a new operation, which we call welding, which applies to an arbitrary finite state automaton. In our context this operation is vital. We point out a small potential improvement in the subset algorithm for making a non-deterministic automaton deterministic.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑