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
Negative immersions for one-relator groups ⋮ The word problem for one-relator semigroups ⋮ SOLUTION OF THE MEMBERSHIP PROBLEM FOR CERTAIN RATIONAL SUBSETS OF ONE-RELATOR GROUPS WITH A SMALL CANCELLATION CONDITION ⋮ Hierarchies of Computable groups and the word problem ⋮ A Lyndon's identity theorem for one-relator monoids ⋮ Heegaard splittings and branched coverings of B 3 ⋮ On some algorithmic problems for groups and monoids ⋮ The JSJ-decompositions of one-relator groups with torsion. ⋮ The genus problem for one-relator products of locally indicable groups ⋮ Zum Identitätsproblem bei Gruppen ⋮ Pseudo-natural algorithms for finitely generated presentations of monoids and groups ⋮ Unsolvable algorithmic problems for semigroups, groups and rings ⋮ Clifford monoid presentations ⋮ Groups with one defining relator ⋮ On the word problem for weakly compressible monoids ⋮ Improved parallel algorithms for generalized Baumslag groups ⋮ Sur la liaison entre problèmes combinatoires et algorithmiques ⋮ Embeddings into groups with only a few defining relations ⋮ Groups, graphs, languages, automata, games and second-order monadic logic ⋮ The word problem for \(1\mathcal{LC}\) congruences is NP-hard. ⋮ EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S GROUP IS IN P ⋮ Towers, ladders and the B. B. Newman Spelling Theorem ⋮ The B B Newman spelling theorem ⋮ Some reflections on proving groups residually torsion-free nilpotent. I. ⋮ Undecidability of the word problem for one-relator inverse monoids via right-angled Artin subgroups of one-relator groups ⋮ Max Dehn ⋮ Complexity of word problems for HNN-extensions ⋮ The outer automorphism groups of two-generator, one-relator groups with torsion ⋮ Free subgroups of groups with a single defining relation ⋮ Finite presentation ⋮ New results on the prefix membership problem for one-relator groups ⋮ Detecting properties from descriptions of groups ⋮ DECISION PROBLEMS FOR FINITELY PRESENTED AND ONE-RELATION SEMIGROUPS AND MONOIDS ⋮ Questions in algebra and mathematical logic. Scientific heritage of S. I. Adian ⋮ On normalizing, non-terminating one-rule string rewriting systems ⋮ Frontier between decidability and undecidability: A survey ⋮ On growth, identities and free subsemigroups for inverse semigroups of deficiency one ⋮ Free subgroups of certain one-relator groups defined by positive words ⋮ On oblivious branching programs of linear length ⋮ Compression techniques in group theory ⋮ Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
