𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing Automatic Coset Systems and Subgroup Presentations

✍ Scribed by D.F. HOLT; D.F. HURT

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
286 KB
Volume
27
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

The concept of an automatic group can be generalized to a group that is automatic with respect to a specified subgroup. This means that there is a finite state automaton that recognizes a unique word in each coset of the subgroup, and others that essentially recognize the permutation action on these cosets induced by multiplying by a group generator. These automata make it possible to enumerate coset representatives as words in the generators, and to solve the generalized word problem for the subgroup efficiently. Algorithms to construct these automata have been described previously by Redfern.

Here we describe improved versions, together with implementation details and some examples of successful calculations. A related algorithm to compute a finite presentation of the subgroup is also described.

πŸ“œ SIMILAR VOLUMES

Adoption and evaluation issues of automa
Adoption and evaluation issues of automatic and computer aided indexing systems
✍ Miguel E. Ruiz; Alan R. Aronson; Marjorie Hlava πŸ“‚ Article πŸ“… 2009 πŸ› Wiley (John Wiley & Sons) 🌐 English βš– 26 KB

## Abstract This panel will present an overview of the state‐of‐the‐art in automatic and computer aided indexing systems, and focus on discussion of the factors that influence the success of the implementation of these system as well as the criteria for evaluation. We also will present several case