Computing automatic coset systems and subgroup presentations

DOI10.1006/jsco.1998.0241zbMath0930.20035OpenAlexW2004603677MaRDI QIDQ1284217

Darren F. Hurt, Derek F. Holt

Publication date: 9 February 2000

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1998.0241

zbMATH Keywords

presentationsautomatic groupsautomatic coset systemsshortlex algorithmsword difference automata

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Grammars and rewriting systems (68Q42) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (8)

Stallings graphs for quasi-convex subgroups ⋮ STALLINGS FOLDINGS AND SUBGROUPS OF AMALGAMS OF FINITE GROUPS ⋮ Geometry of the word problem for 3-manifold groups ⋮ Combinatorial invariance of Kazhdan-Lusztig polynomials on intervals starting from the identity. ⋮ Using rewriting systems to compute left Kan extensions and induced actions of categories ⋮ Automaticity for graphs of groups ⋮ Computing subgroup presentations, using the coherence arguments of McCammond and Wise. ⋮ Computing with Abelian sections of finitely presented groups

Uses Software

• kbmag

This page was built for publication: Computing automatic coset systems and subgroup presentations