kbmag
The kbmag package is a GAP interface to some `C’ programs for running the Knuth-Bendix completion program on finite semigroup, monoid or group presentations, and for attempting to compute automatic structures of finitely presented groups.
Keywords for this software
References in zbMATH (referenced in 12 articles )
Showing results 1 to 12 of 12.
Sorted by year (- Edjvet, Martin; Swan, Jerry: On irreducible cyclic presentations of the trivial group. (2014)
- Edjvet, Martin; Spanu, Bruno: On a certain class of cyclically presented groups. (2011)
- Swan, Jerry: Efficiency issues in the KBMAG procedure (2011)
- Cremona, J.E.; Edjvet, M.: Cyclically presented groups and resultants. (2010)
- Edjvet, M.; Juhász, A.: The groups $G^m,n,p$. (2008)
- Hermiller, Susan; Holt, Derek F.; Rees, Sarah: Groups whose geodesics are locally testable. (2008)
- Payne, Oliver; Rees, Sarah: Computing subgroup presentations, using the coherence arguments of McCammond and Wise. (2006)
- Ollivier, Yann: A January 2005 invitation to random groups. (2005)
- Epstein, David B.A.; Holt, Derek F.: Efficient computation in word-hyperbolic groups (2000)
- Epstein, D.B.A.; Sanders, P.J.: Knuth-Bendix for groups with infinitely many rules (2000)
- Holt, Derek F.; Hurt, Darren F.: Computing automatic coset systems and subgroup presentations (1999)
- Malle, Gunter: Presentations for crystallographic complex reflection groups (1996)