Publicação
Pointlike sets with respect to R and J
| Resumo: | 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. |
|---|---|
| Autores principais: | Almeida, Jorge |
| Outros Autores: | Costa, José Carlos; Zeitoun, Marc |
| Assunto: | Pointlike set R-trivial semigroup Relatively free profinite semigroup |
| Ano: | 2008 |
| País: | Portugal |
| Tipo de documento: | artigo |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Universidade do Minho |
| Idioma: | inglês |
| Origem: | RepositóriUM - Universidade do Minho |
| Resumo: | 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. |
|---|