The word problem for groups with regular relations. Improvement of the Knuth-Bendix algorithm
From MaRDI portal
(Redirected from Publication:1328892)
Recommendations
- KNUTH–BENDIX FOR GROUPS WITH INFINITELY MANY RULES
- Efficient solution of the word problem in slim varieties
- A completion procedure for finitely presented groups that is based on word cycles
- The use of Knuth-Bendix methods to solve the word problem in automatic groups
- scientific article; zbMATH DE number 3918657
Cites work
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 66564 (Why is no real title available?)
- scientific article; zbMATH DE number 67431 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Optimization of LR(k) parsers
- Presentations of groups and monoids
Cited in
(4)
This page was built for publication: The word problem for groups with regular relations. Improvement of the Knuth-Bendix algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328892)