Infinite complete group presentations

DOI10.1016/0022-4049(95)00108-5zbMath0862.20025OpenAlexW1995094274MaRDI QIDQ1916428

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) Free semigroups, generators and relations, word problems (20M05) Grammars and rewriting systems (68Q42) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (3)

Homology of Gaussian groups. ⋮ Algebra and automated deduction ⋮ ON CERTAIN PAIRS OF NON-ENGEL ELEMENTS IN FINITE GROUPS

Cites Work

• A catalogue of complete group presentations
• Systems of reductions
• Word problems and a homological finiteness condition for monoids
• The use of Knuth-Bendix methods to solve the word problem in automatic groups
• Presentations of groups and monoids
• Completion for rewriting modulo a congruence
• Rewriting systems of Coxeter groups
• Infinite regular Thue systems
• Proving termination with multiset orderings
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• A Finitely Presented Group Whose 3-Dimensional Integral Homology is not Finitely Generated
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Infinite complete group presentations