Abstract. We describe briefly some practical procedures for computing the various constants associated with a word-hyperbolic group, and report on the performance of their implementations in the KBMAG package on a number of examples. More complete technical details will be published elsewhere.
INTRODUCTION
During the mid 1980's, there was a growing demand for efficient computational methods for solving some of the classical decision problems, such as the word, conjugacy and isomorphism problems, in infinite finitely presented groups. These are of course theoretically undecidable in general, but some of them have been proved to be solvable in various special classes of groups, such as braid groups, Coxeter groups and knot groups. At that time, the only existing general technique for attempting to solve the word problem on a computer was the Knuth-Bendix algorithm (see, for example [Gilman, 1979]). However, this was not really satisfactory, because most of the time it did not work, and making it work at all for infinite groups usually depended on an appropriate and often non-obvious choice of an ordered generating set for the group.
In 1985, the concept of an automatic group was introduced by Thurston, as a formulation in terms of finite state automata of various geometrical properties of discrete cocompact groups of isometries of hyperbolic space that had been proved by Jim Cannon in [Cannon, 84]. Many familiar classes of groups, including word-hyperbolic groups, virtually abelian groups, Coxeter groups, braid groups and most knot groups have been shown to be automatic. The word problem is solvable (by reduction of words to a normal form) in quadratic time in these groups.