In this paper we prove several results regarding decidability ofthe membership problem for certain submonoids in amalgamated free prod-ucts and HNN extensions of groups. These general results are then appliedto solve the prefix membership problem for a number of classes of one-relatorgroups which are low in the Magnus–Moldavanski ̆ı hierarchy. Since the pre-fix membership problem for one-relator groups is intimately related to theword problem for one-relator special inverse monoids in theE-unitary case(as discovered in 2001 by Ivanov, Margolis and Meakin), these results yieldsolutions of the word problem for several new classes of one-relator specialinverse monoids. In establishing these results, we introduce a new theory ofconservative fac...
A triple [S,T;U] where S and T are inverse semigroups and U is the intersection of S and T is called...
Diese Masterarbeit behandelt das Wortproblem für Gruppen; in drei einleitenden Kapiteln werden der R...
This survey is intended to provide an overview of one of the oldest and most celebrated open problem...
A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the pre...
AbstractIt is known that the word problem for one-relator groups and for one-relator monoids of the ...
We prove the following results: (1) There is a one-relator inverse monoid Inv⟨A|w=1⟩ with undecidabl...
We prove that one-relator groups with negative immersions are hyperbolic and virtually special; this...
We develop the theory of fragile words by introducing the concept of eraser morphism and extending t...
In this talk we develop a graph theoretical test on graphs corresponding to subgroups of one-relator...
Chapter 1 defines basic ideas such as definition of monoids, homomorphisms of monoids, congruences, ...
AbstractThe membership problem in transformation monoids is the natural extension to the well-studie...
We investigate the groups of units of one-relator and special inverse monoids. These are inverse mon...
Rewriting techniques have been applied successfully to various areas of symbolic computation. Here w...
This dissertation concerns two problems from computational algebra, the word problem for semigroups ...
Let G be a finitely generated virtually-free group. We consider the Birget-Rhodes expansion of G, wh...
A triple [S,T;U] where S and T are inverse semigroups and U is the intersection of S and T is called...
Diese Masterarbeit behandelt das Wortproblem für Gruppen; in drei einleitenden Kapiteln werden der R...
This survey is intended to provide an overview of one of the oldest and most celebrated open problem...
A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the pre...
AbstractIt is known that the word problem for one-relator groups and for one-relator monoids of the ...
We prove the following results: (1) There is a one-relator inverse monoid Inv⟨A|w=1⟩ with undecidabl...
We prove that one-relator groups with negative immersions are hyperbolic and virtually special; this...
We develop the theory of fragile words by introducing the concept of eraser morphism and extending t...
In this talk we develop a graph theoretical test on graphs corresponding to subgroups of one-relator...
Chapter 1 defines basic ideas such as definition of monoids, homomorphisms of monoids, congruences, ...
AbstractThe membership problem in transformation monoids is the natural extension to the well-studie...
We investigate the groups of units of one-relator and special inverse monoids. These are inverse mon...
Rewriting techniques have been applied successfully to various areas of symbolic computation. Here w...
This dissertation concerns two problems from computational algebra, the word problem for semigroups ...
Let G be a finitely generated virtually-free group. We consider the Birget-Rhodes expansion of G, wh...
A triple [S,T;U] where S and T are inverse semigroups and U is the intersection of S and T is called...
Diese Masterarbeit behandelt das Wortproblem für Gruppen; in drei einleitenden Kapiteln werden der R...
This survey is intended to provide an overview of one of the oldest and most celebrated open problem...