Finite complete rewriting systems for groups

DOI10.1080/00927879708826105zbMath0914.20032OpenAlexW4247561191MaRDI QIDQ4384697

Deko V. Dekov

Publication date: 20 June 1999

Published in: Communications in Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00927879708826105

zbMATH Keywords

finitely presented groupsone-relator groupsfinite complete rewriting systems

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)

Related Items (1)

Geometry of the word problem for 3-manifold groups

Cites Work

• Unnamed Item
• Unnamed Item
• Orderings for term-rewriting systems
• Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group
• A catalogue of complete group presentations
• Systems of reductions
• Rewriting systems of Coxeter groups
• Term rewriting for the conjugacy problem and the braid groups
• On theories with a combinatorial definition of 'equivalence'

This page was built for publication: Finite complete rewriting systems for groups