Dehn's algorithm for the word problem

Cited in

(29)

Model-theoretic and algorithmic questions in group theory
Finitely generated groups L with \(L\approx L\times M\), \(M\neq 1\), M finitely presented
Traces, lengths, and simplicity for loops on surfaces
A catalogue of complete group presentations
Thue systems as rewriting systems
Analysis of Dehn's algorithm by critical pairs
History and basic features of the critical-pair/completion procedure
Unsolvable algorithmic problems for semigroups, groups and rings
Max Dehn
The word problem for one-relation monoids: a survey
Quadric complexes
A topological zero-one law and elementary equivalence of finitely generated groups
Small cancellation theory over Burnside groups
Sur le problème des mots des quotients de groupes et produits libres
The word problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable.
Generalized small cancellation conditions, non-positive curvature and diagrammatic reducibility
Courbure mésoscopique et théorie de la toute petite simplification
Some results on one-relator groups
Concerning a Bound Problem in Knot Theory
On conjugate powers in eighth-groups
On the genera of graphs of group presentations. II
On the genera of graphs of group presentations. II
On the failure of the co-Hopf property for subgroups of word-hyperbolic groups
Ordering the space of finitely generated groups
Isoperimetric inequalities in finitely generated groups
Regular and semi-regular representations of groups by posets
On mathematical contributions of Paul E. Schupp
Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group
On the concept of ``largeness in group theory.

This page was built for publication: Dehn's algorithm for the word problem

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