Automatic Groups Associated with Word Orders Other than Shortlex

The existing algorithm to compute and verify the automata associated with an automatic group deals only with the subclass of shortlex automatic groups. This paper describes the extension of the algorithm to deal with automatic groups associated with other word orders (the algorithm has now been implemented) and reports on the use of the algorithm for specific examples; in particular a very natural automatic (or asynchonously automatic) structure for the Baumslag–Solitar and related classes of groups (closely related to one described for some of those groups by Epstein et al.) is found from a wreath product order over shortlex.

[1]  Robert F. Riley.  A quadratic parabolic group , 1975, Mathematical Proceedings of the Cambridge Philosophical Society.

[2]  J. Cannon.  The combinatorial structure of cocompact discrete hyperbolic groups , 1984 .

[3]  S. Hermiller.  Rewriting systems for Coxeter groups , 1994 .

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

[5]  S. Gersten,et al.  Small cancellation theory and automatic groups , 1990 .

[6]  R. Howlett,et al.  A finiteness property an an automatic structure for Coxeter groups , 1993 .

[7]  Robert H. Gilman.  Presentations of groups and monoids , 1979 .

[8]  Ruth Charney,et al.  Geodesic automation and growth functions for Artin groups of finite type , 1995 .

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

[10]  Robert H. Gilman,et al.  A Remark about Combings of Groups , 1993, Int. J. Algebra Comput..

[11]  Quasigeodesics outside horoballs , 1996 .

[12]  Ruth Charney,et al.  Artin groups of finite type are biautomatic , 1992 .

[13]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

[14]  Derek F. Holt.  The Warwick automatic groups software , 1994, Geometric and Computational Perspectives on Infinite Groups.

[15]  Lee Mosher,et al.  Mapping class groups are automatic , 1995 .

[16]  Robert F. Riley.  Discrete parabolic representations of link groups , 1975 .

[17]  David Peifer.  Artin groups of extra-large type are biautomatic , 1996 .