A polynomial time algorithm to compute the Abelian kernel of a finite monoid

DOI10.1007/s00233-002-0004-6zbMath1029.20030OpenAlexW2081347469MaRDI QIDQ1402910

Pierre-Cyrille Héam, Manuel Delgado

Publication date: 31 August 2003

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00233-002-0004-6

zbMATH Keywords

algorithmsfinite groupsCayley graphsprofinite topologypseudovarietiesfinite monoidsfree Abelian groupsAbelian group kernel

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

On the complexity of computing the profinite closure of a rational language ⋮ Computing relative Abelian kernels of finite monoids.

Uses Software

• GAP

This page was built for publication: A polynomial time algorithm to compute the Abelian kernel of a finite monoid