Skip to main content
SpringerLink
Log in

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

  • Research Article
  • Published:
Semigroup Forum Aims and scope Submit manuscript

Abstract

The time complexity of the best previously known algorithm to compute the Abelian kernel of a finite monoid with a fixed number of generators is exponential. In this paper we use results on subgroups of the free Abelian group and constructions on labeled graphs to develop a polynomial time algorithm for this problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Centro de Matemática da Universidade do Porto, Rua do Campo Alegre, 687, 4169-007, Porto, Portugal

    Manuel Delgado

  2. LIFC, Université de Franche-Comté, 16 route de Gray, 25030, Besançon Cedex, France

    Pierre-Cyrille Héam

Authors
  1. Manuel Delgado
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre-Cyrille Héam
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Manuel Delgado.

Additional information

Communicated by Howard Straubing

Rights and permissions

Reprints and permissions

About this article

Cite this article

Delgado, M., Héam, PC. A polynomial time algorithm to compute the Abelian kernel of a finite monoid. Semigroup Forum 67, 97–110 (2003). https://doi.org/10.1007/s00233-002-0004-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00233-002-0004-6

Keywords

Search

Navigation