论文信息 - The Warwick automatic groups software

The Warwick automatic groups software

This paper provides a description of the algorithms employed by the Warwick AUTOMATA package for calculating the finite state automata associated with a short-lex automatic group. The aim is to provide an overview of the whole process, rather than concentrating on technical details, which have been already been published elsewhere. A number of related programs are also described.

Derek F. Holt

[1] David B. A. Epstein,et al. The Use of Knuth-Bendix Methods to Solve the Word Problem in Automatic Groups , 1991, J. Symb. Comput..

[2] M. F. Newman. Proving a group infinite , 1990 .

[3] Derek F. Holt. An Alternative Proof That the Fibonacci Group F(2, 9) is Infinite , 1995, Exp. Math..

[4] Richard G. Swan,et al. Generators and relations for certain special linear groups , 1968 .

[5] P. Papasoglu,et al. Strongly geodesically automatic groups are hyperbolic , 1995 .