Finding a finite group presentation using rewriting
From MaRDI portal
(Redirected from Finding a finite group presentation using rewriting)
Recommendations
- Infinite complete group presentations
- A completion procedure for finitely presented groups that is based on word cycles
- Finite complete rewriting systems for groups
- A rewriting alternative to Reidemeister-Schreier
- A specialized completion procedure for monadic string-rewriting systems presenting groups
Cited in
(9)- A completion procedure for finitely presented groups that is based on word cycles
- Infinite complete group presentations
- Rewriting techniques in theoretical physics
- A rewriting alternative to Reidemeister-Schreier
- scientific article; zbMATH DE number 2070162 (Why is no real title available?)
- scientific article; zbMATH DE number 849022 (Why is no real title available?)
- PATCH graphs: an efficient data structure for completion of finitely presented groups
- Finding k shortest paths in Cayley graphs of finite groups
- Congruence closure modulo groups
This page was built for publication: Finding a finite group presentation using rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4225071)
