Computing relative abelian kernels of finite monoids
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...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2010
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10198/1513 |
| País: | Portugal |
| Oai: | oai:bibliotecadigital.ipb.pt:10198/1513 |
| Resumo: | 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. |
|---|