Finding a finite group presentation using rewriting

MaRDI QIDQ4225071zbMATH OpenFDO

Authors Polina Strogova

Publication date 18 January 1999

zbMATH Keywords

Knuth-Bendix completion procedurerewriting system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Infinite complete group presentations
• A completion procedure for finitely presented groups that is based on word cycles
• Finite complete rewriting systems for groups
• scientific article; zbMATH DE number 2043547
• scientific article; zbMATH DE number 176741

Cited in

(9)

• A completion procedure for finitely presented groups that is based on word cycles
• Infinite complete group presentations
• scientific article; zbMATH DE number 1615231 (Why is no real title available?)
• scientific article; zbMATH DE number 2043547 (Why is no real title available?)
• 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)