The Warwick Automatic Groups Software
Derek F. Holt
Abstract
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.
Create a lesson
Related papers
The variety generated by all additively idempotent semirings of order four
Mengya Yue, Xiaolei Shao
Generation of Iterated Wreath Products Constructed from Full Transformation Monoids and Symmetric Groups
Jiaping Lu
Kernel--wreath constructions and infinite families of finite simple skew braces
Marco Damele
Explicit equational bases for the power semirings of S7
Mengya Yue, Miaomiao Ren, Zidong Gao
The free multiplicative Lie algebra L(P) for a finitely generated parafree group P
Dessislava H. Kochloukova
An order automorphism of a Dlab group not induced by conjugation
Ting Gong, Yong Yang, Michael Ruofan Zeng