Finite complete rewriting systems for groups

DOI10.1080/00927879708826105zbMATH Open0914.20032OpenAlexW4247561191MaRDI QIDQ4384697FDOQ4384697

Authors: 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

Recommendations

• scientific article; zbMATH DE number 2074997
• Rewriting systems of Coxeter groups
• Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group
• scientific article; zbMATH DE number 67429

zbMATH Keywords

one-relator groupsfinitely presented 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)

Cites Work

• Orderings for term-rewriting systems
• On theories with a combinatorial definition of 'equivalence'
• Title not available (Why is that?)
• A catalogue of complete group presentations
• Rewriting systems of Coxeter groups
• Title not available (Why is that?)
• Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group
• Term rewriting for the conjugacy problem and the braid groups
• Systems of reductions

Cited In (13)

• Finite complete rewriting systems for regular semigroups.
• Subgroups of finite index in groups with finite complete rewriting systems
• Constructing finitely presented monoids which have no finite complete presentation
• Title not available (Why is that?)
• Using groups for investigating rewrite systems
• Complete rewriting system for the Schützenberger product of \(n\) groups
• Title not available (Why is that?)
• Finding \(k\) shortest paths in Cayley graphs of finite groups
• Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group
• Geometry of the word problem for 3-manifold groups
• Rewriting systems and complete growth series for triangular Coxeter groups.
• Soluble groups with a finite rewriting system
• Theorem proving with group presentations: examples and questions

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

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