Infinite complete group presentations
From MaRDI portal
Publication:1916428
DOI10.1016/0022-4049(95)00108-5zbMath0862.20025MaRDI QIDQ1916428
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
normal forms; efficient solutions; word problem; Knuth-Bendix procedure; complete rewrite systems; equational term rewriting; infinite complete presentations
20F05: Generators, relations, and presentations of groups
20M05: Free semigroups, generators and relations, word problems
68Q42: Grammars and rewriting systems
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
Related Items
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