Dehn's algorithm for the word problem
From MaRDI portal
Publication:3288144
DOI10.1002/cpa.3160130108zbMath0104.01903OpenAlexW2072798760WikidataQ56068238 ScholiaQ56068238MaRDI QIDQ3288144
Publication date: 1960
Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/cpa.3160130108
Related Items
Finitely generated groups L with \(L\approx L\times M\), \(M\neq 1\), M finitely presented, Traces, lengths, and simplicity for loops on surfaces, Some results on one-relator groups, A catalogue of complete group presentations, On the concept of ``largeness in group theory., 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, Generalized small cancellation conditions, non-positive curvature and diagrammatic reducibility, The word problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable., On conjugate powers in eighth-groups, Quadric complexes, A topological zero-one law and elementary equivalence of finitely generated groups, Concerning a Bound Problem in Knot Theory, The word problem for one-relation monoids: a survey, On the failure of the co-Hopf property for subgroups of word-hyperbolic groups, On mathematical contributions of Paul E. Schupp, Ordering the space of finitely generated groups, Max Dehn, Sur le problème des mots des quotients de groupes et produits libres, 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, Small cancellation theory over Burnside groups, Courbure mésoscopique et théorie de la toute petite simplification, Model-theoretic and algorithmic questions in group theory
