Dehn's algorithm for the word problem

Cited in

(29)

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

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)