2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/152991This 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.AMS-Tex, 14 pages, no figures. To appear in Proceedings of DIMACS Conference on Computational Group Theory, 1994Group Theorytext