Infinite complete group presentations

DOI10.1016/0022-4049(95)00108-5MaRDI QIDQ1916428zbMATH OpenOpenAlexFDO

Authors Roger E. Needham

Publication date 27 May 1997

Published in Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-4049(95)00108-5

zbMATH Keywords

normal formsefficient solutionsword problemKnuth-Bendix procedurecomplete rewrite systemsequational term rewritinginfinite complete presentations

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Grammars and rewriting systems (68Q42) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Free semigroups, generators and relations, word problems (20M05)

Recommendations

• A completion procedure for finitely presented groups that is based on word cycles
• scientific article; zbMATH DE number 1241632
• A catalogue of complete group presentations
• Crossed product of infinite groups and complete rewriting systems
• KNUTH–BENDIX FOR GROUPS WITH INFINITELY MANY RULES

Cites work

• scientific article; zbMATH DE number 3889793 (Why is no real title available?)
• scientific article; zbMATH DE number 4074540 (Why is no real title available?)
• scientific article; zbMATH DE number 3688776 (Why is no real title available?)
• scientific article; zbMATH DE number 53661 (Why is no real title available?)
• scientific article; zbMATH DE number 67429 (Why is no real title available?)
• scientific article; zbMATH DE number 67430 (Why is no real title available?)
• A Finitely Presented Group Whose 3-Dimensional Integral Homology is not Finitely Generated
• A catalogue of complete group presentations
• Completion for rewriting modulo a congruence
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Infinite regular Thue systems
• Presentations of groups and monoids
• Proving termination with multiset orderings
• Rewriting systems of Coxeter groups
• Systems of reductions
• The use of Knuth-Bendix methods to solve the word problem in automatic groups
• Word problems and a homological finiteness condition for monoids

Cited in

(10)

• Homology of Gaussian groups.
• Crossed product of infinite groups and complete rewriting systems
• A completion procedure for finitely presented groups that is based on word cycles
• A catalogue of complete group presentations
• On certain pairs of non-Engel elements in finite groups.
• Algebra and automated deduction
• scientific article; zbMATH DE number 1836320 (Why is no real title available?)
• Infinite groups arising from partial presentations of finite groups
• Complete presentations of direct products of groups.
• Recursively presented two generated infinite p-groups

This page was built for publication: Infinite complete group presentations

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