On the ...-class of a product.
On the classes of orderable semigroups in varieties.
On the closure of B2 ( ...,...).
On the closure of bisimple w-semigroups.
On the Complete Integral Closure of a Mori Domain
On the complexity of the word problem for finitely presented commutative semigroups.
On the congruence extension property.
On the construction of bisimple orthodox semigroups.
On the construction of some semigroups
On the converse of a theorem of Harte and Mbekhta: Erratum to "On generalized inverses in C*-algebras"
We prove that the converse of Theorem 9 in "On generalized inverses in C*-algebras" by Harte and Mbekhta (Studia Math. 103 (1992)) is indeed true.
On the decidability of semigroup freeness∗
This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of the following two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoids....
On the decidability of semigroup freeness
This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of the following two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoids. In 1991, Klarner, Birget and Satterfield proved the undecidability...
On the decidability of semigroup freeness∗
This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of the following two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoids....
On the decomposition of prime ideals of ordered semigroups into their N-classes.
On the decomposition of RL-semigroups into groups.
On the defect theorem and simpliflability.
On the deficit of a set of words.
On the degree of finite maximal biprefix codes.
On the Delta set of a singular arithmetical congruence monoid
If and are positive integers with and , then the setis a multiplicative monoid known as an arithmetical congruence monoid (or ACM). For any monoid with units and any we say that is a factorization length of if and only if there exist irreducible elements of and . Let be the set of all such lengths (where whenever ). The Delta-set of the element is defined as the set of gaps in : and the Delta-set of the monoid is given by . We consider the when is an ACM with...
On the elementary theory of free inverse semigroups.