Showing math.GRShow all
3 papers · 1 filter
math.GR2000
Knuth-Bendix for groups with infinitely many rules
D. B. A. Epstein, P. J. Sanders
It is shown how to use a small finite state automaton in two variables in order to carry out the Knuth-Bendix process for rewriting words in a group in shortlex order. The two-vari…
math.GR1998
Computation in word-hyperbolic groups
David B. A. Epstein, Derek F. Holt
We describe a procedure which verifies that a group given by generators and relators is word-hyperbolic. This procedure always works with a group which is word-hyperbolic, provided…
math.GR1998
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…