Let H be a pseudovariety of abelian groups corresponding to a recursive supernatural number. In this note we explain how a concrete implementation of an algorithm to compute the kernel of a finite monoid relative to H can be achieved. The case of the pseudovariety Ab of all finite abelian groups was already treated by the second author and plays an important role here, where we will be interested in the proper subpseudovarieties of Ab. Our work relies on an algorithm obtained by Steinberg
We present an algorithm to compute the pointlike subsets of a finite semigroup with respect to the p...
AbstractThe Conjecture of Rhodes, originally called the “type II conjecture” by Rhodes, gives an alg...
AbstractThe last decade has seen two methodological advances of particular direct import for the the...
AbstractLet H be a pseudovariety of abelian groups corresponding to a recursive supernatural number....
We consider members of some well studied classes of finite transformation monoids and give descri...
The notion of kernel of a finite monoid relative to a pseudovariety of groups can be used to define ...
International Journal of Algebra and Computation, 15, nº 3 (2005), p. 547-570The notion of Abelian k...
Semigroup Forum vol. 68 (2004), p. 335–356We compute the abelian kernels of some monoids of partial ...
The first section of this chapter contains algorithms about subgroups of finite index of an abstract...
by Jin Mai.Thesis (M.Phil.)--Chinese University of Hong Kong, 1996.Includes bibliographical referenc...
In this paper we compute the abelian kernels of the monoids POI n and POPI n of all injective order ...
AbstractThe smallest pseudovariety containing all finite R-trivial or L-trivial monoids is described...
We consider implicit signatures over finite semigroups determined by sets of pseudonatural numbers. ...
AbstractA classification scheme for regular languages or finite semigroups was proposed by Pin throu...
It is shown that the pseudovariety R of all finite R-trivial semigroups is completely reducible wit...
We present an algorithm to compute the pointlike subsets of a finite semigroup with respect to the p...
AbstractThe Conjecture of Rhodes, originally called the “type II conjecture” by Rhodes, gives an alg...
AbstractThe last decade has seen two methodological advances of particular direct import for the the...
AbstractLet H be a pseudovariety of abelian groups corresponding to a recursive supernatural number....
We consider members of some well studied classes of finite transformation monoids and give descri...
The notion of kernel of a finite monoid relative to a pseudovariety of groups can be used to define ...
International Journal of Algebra and Computation, 15, nº 3 (2005), p. 547-570The notion of Abelian k...
Semigroup Forum vol. 68 (2004), p. 335–356We compute the abelian kernels of some monoids of partial ...
The first section of this chapter contains algorithms about subgroups of finite index of an abstract...
by Jin Mai.Thesis (M.Phil.)--Chinese University of Hong Kong, 1996.Includes bibliographical referenc...
In this paper we compute the abelian kernels of the monoids POI n and POPI n of all injective order ...
AbstractThe smallest pseudovariety containing all finite R-trivial or L-trivial monoids is described...
We consider implicit signatures over finite semigroups determined by sets of pseudonatural numbers. ...
AbstractA classification scheme for regular languages or finite semigroups was proposed by Pin throu...
It is shown that the pseudovariety R of all finite R-trivial semigroups is completely reducible wit...
We present an algorithm to compute the pointlike subsets of a finite semigroup with respect to the p...
AbstractThe Conjecture of Rhodes, originally called the “type II conjecture” by Rhodes, gives an alg...
AbstractThe last decade has seen two methodological advances of particular direct import for the the...