Add to ORKGThe class of all completely regular semigroups, when considered as unary semigroups, forms a variety. This gives rise to questions concerning the solvability of the word problem for completely regular semigroup presentations. Several types of completely regular semigroup presentations are considered and solutions to word problems have been provided. Presentations within certain subvarieties of the variety of all completely regular semigroups are also considered. We prove that certain questions concerning completely regular semigroup presentations are undecidable
A method for finding presentations for subsemigroups of semigroups defined by presentations is used ...
An automatic presentation for a relational structure is, informally, an abstract representation of t...
The D-compatible semigroup varieties will be characterized and described. It is found that a semigro...
The class of all completely regular semigroups, when considered as unary semigroups, forms a variety...
If $\langle X\vert\kappa\sb{\rm CR}\rangle$ is a presentation of a completely regular semigroup, the...
Semigroup theory typically looks at algebraic structures which are generalizations of groups. An exa...
Semigroup theory typically looks at algebraic structures which are generalizations of groups. An exa...
AbstractIt will be shown that every finitely presented group is the greatest group homomorphic image...
AbstractWe apply automata-theoretic tools and some recently established compactness properties in th...
AbstractThe decidability of the uniform word problem in a pseudovariety V of groups is known to be e...
Abstracts -regulur semigroups are promotion of -regular semigroups. In the paper we show that a semi...
Abstract: This note shows that, even though a paper of Almeida and Trotter on completely regular sem...
It will be shown that every finitely presented group is the greatest group homomorphic image of a fi...
It will be shown that every finitely presented group is the greatest group homomorphic image of a fi...
The decidability of the uniform word problem in a pseudovariety V of groups is known to be equivalen...
A method for finding presentations for subsemigroups of semigroups defined by presentations is used ...
An automatic presentation for a relational structure is, informally, an abstract representation of t...
The D-compatible semigroup varieties will be characterized and described. It is found that a semigro...
The class of all completely regular semigroups, when considered as unary semigroups, forms a variety...
If $\langle X\vert\kappa\sb{\rm CR}\rangle$ is a presentation of a completely regular semigroup, the...
Semigroup theory typically looks at algebraic structures which are generalizations of groups. An exa...
Semigroup theory typically looks at algebraic structures which are generalizations of groups. An exa...
AbstractIt will be shown that every finitely presented group is the greatest group homomorphic image...
AbstractWe apply automata-theoretic tools and some recently established compactness properties in th...
AbstractThe decidability of the uniform word problem in a pseudovariety V of groups is known to be e...
Abstracts -regulur semigroups are promotion of -regular semigroups. In the paper we show that a semi...
Abstract: This note shows that, even though a paper of Almeida and Trotter on completely regular sem...
It will be shown that every finitely presented group is the greatest group homomorphic image of a fi...
It will be shown that every finitely presented group is the greatest group homomorphic image of a fi...
The decidability of the uniform word problem in a pseudovariety V of groups is known to be equivalen...
A method for finding presentations for subsemigroups of semigroups defined by presentations is used ...
An automatic presentation for a relational structure is, informally, an abstract representation of t...
The D-compatible semigroup varieties will be characterized and described. It is found that a semigro...