We present an algorithm to compute the pointlike subsets of a finite semigroup with respect to the pseudovariety R of all finite R-trivial semigroups. The algorithm is inspired by Henckell’s algorithm for computing the pointlike subsets with respect to the pseudovariety of all finite aperiodic semigroups. We also give an algorithm to compute J-pointlike sets, where J denotes the pseudovariety of all finite J-trivial semigroups. We finally show that, in contrast with the situation for R, the natural adaptation of Henckell’s algorithm to J computes pointlike sets, but not all of them.Pessoa French-Portuguese project Egide- Grices 11113YMFundação para a Ciência e a Tecnologia (FCT
It is shown that the pseudovariety R of all finite R-trivial semigroups is completely reducible wit...
We consider implicit signatures over finite semigroups determined by sets of pseudonatural numbers. ...
This paper is concerned with the structure of implicit operations on R intersection with LJ1, the ps...
AbstractWe present an algorithm to compute the pointlike subsets of a finite semigroup with respect ...
Abstract. We present an algorithm to compute the pointlike subsets of a finite semigroup with respec...
AbstractWe present an algorithm to compute the pointlike subsets of a finite semigroup with respect ...
We show that the pointlike and the idempotent pointlike problems are reducible with respect to natur...
We show that the pointlike and the idempotent pointlike problems are reducible with respect to natur...
AbstractWe compute a set of identities defining the Mal'cev product of pseudovarieties of finite sem...
In this paper, we investigate the reducibility property of semidirect products of the form V *D rela...
AbstractLet J be the pseudovariety of all finite J-trivial semigroups and let Ω̄nJ denote the...
AbstractThe research in this paper is motivated by the open question: “Is the complexity of a finite...
AbstractWe compute a set of identities defining the Mal'cev product of pseudovarieties of finite sem...
Given a regular language L, we effectively construct a unary semigroup that recognizes the topologic...
by Jin Mai.Thesis (M.Phil.)--Chinese University of Hong Kong, 1996.Includes bibliographical referenc...
It is shown that the pseudovariety R of all finite R-trivial semigroups is completely reducible wit...
We consider implicit signatures over finite semigroups determined by sets of pseudonatural numbers. ...
This paper is concerned with the structure of implicit operations on R intersection with LJ1, the ps...
AbstractWe present an algorithm to compute the pointlike subsets of a finite semigroup with respect ...
Abstract. We present an algorithm to compute the pointlike subsets of a finite semigroup with respec...
AbstractWe present an algorithm to compute the pointlike subsets of a finite semigroup with respect ...
We show that the pointlike and the idempotent pointlike problems are reducible with respect to natur...
We show that the pointlike and the idempotent pointlike problems are reducible with respect to natur...
AbstractWe compute a set of identities defining the Mal'cev product of pseudovarieties of finite sem...
In this paper, we investigate the reducibility property of semidirect products of the form V *D rela...
AbstractLet J be the pseudovariety of all finite J-trivial semigroups and let Ω̄nJ denote the...
AbstractThe research in this paper is motivated by the open question: “Is the complexity of a finite...
AbstractWe compute a set of identities defining the Mal'cev product of pseudovarieties of finite sem...
Given a regular language L, we effectively construct a unary semigroup that recognizes the topologic...
by Jin Mai.Thesis (M.Phil.)--Chinese University of Hong Kong, 1996.Includes bibliographical referenc...
It is shown that the pseudovariety R of all finite R-trivial semigroups is completely reducible wit...
We consider implicit signatures over finite semigroups determined by sets of pseudonatural numbers. ...
This paper is concerned with the structure of implicit operations on R intersection with LJ1, the ps...