Analysis of Dehn's algorithm by critical pairs
From MaRDI portal
Publication:1100558
DOI10.1016/0304-3975(87)90048-XzbMath0641.20026MaRDI QIDQ1100558
Publication date: 1987
Published in: Theoretical Computer Science (Search for Journal in Brave)
word problemdefining relationssmall cancellation groupsDehn's algorithmsymmetrization algorithmsymmetrized set of rewriting rules
Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Software, source code, etc. for problems pertaining to group theory (20-04) Cancellation theory of groups; application of van Kampen diagrams (20F06)
Cites Work
- Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group
- The word and conjugacy problems for a class of groups with nonhomogeneous conditions of small cancellation
- A complete proof of correctness of the Knuth-Bendix completion algorithm
- On Dehn's algorithm
- Dehn's algorithm for the word problem
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- On Dehn's algorithms for the conjugacy and word problems, with applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
