scientific article; zbMATH DE number 1241632

zbMATH Open0915.68099MaRDI QIDQ4225071FDOQ4225071

Authors: Polina Strogova 

Publication date: 18 January 1999

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

rewriting systemKnuth-Bendix completion procedure

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (7)

• PATCH graphs: an efficient data structure for completion of finitely presented groups
• A completion procedure for finitely presented groups that is based on word cycles
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding \(k\) shortest paths in Cayley graphs of finite groups
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4225071)