1997/05/28 by Sarah Rees, Rees, Sarah
Computer Science · Mathematics · #FOS: Mathematics #Finite Group Theory Research #Geometric and Algebraic Topology #Group Theory (math.GR) #math.GR #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.math/9705208
DVI and Post-Script files only, 27 pages. Accepted by the International Journal of Algebra and Computation
arxiv created 1997/05/28 · openalex publication_date 1997/05/28 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.