Das Identitätsproblem für Gruppen mit einer definierenden Relation
From MaRDI portal
Publication:1353135
DOI10.1007/BF01455888zbMath0004.09709MaRDI QIDQ1353135
Publication date: 1932
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/159554
Related Items
Free subgroups of certain one-relator groups defined by positive words, Groups with one defining relator, Hierarchies of Computable groups and the word problem, On oblivious branching programs of linear length, Pseudo-natural algorithms for the word problem for finitely presented monoids and groups, Heegaard splittings and branched coverings of B 3, Pseudo-natural algorithms for finitely generated presentations of monoids and groups, Unsolvable algorithmic problems for semigroups, groups and rings, Sur la liaison entre problèmes combinatoires et algorithmiques, Max Dehn, The word problem for \(1\mathcal{LC}\) congruences is NP-hard., On normalizing, non-terminating one-rule string rewriting systems, Frontier between decidability and undecidability: A survey, Free subgroups of groups with a single defining relation, The genus problem for one-relator products of locally indicable groups, Zum Identitätsproblem bei Gruppen, Towers, ladders and the B. B. Newman Spelling Theorem, The word problem for one-relator semigroups, Clifford monoid presentations, Embeddings into groups with only a few defining relations
