Algorithms for computing finite semigroups - Archive ouverte HAL
Communication Dans Un Congrès Année : 1997

Algorithms for computing finite semigroups

Résumé

The aim of this paper is to present algorithms to compute finite semigroups. The semigroup is given by a set of generators taken in a larger semigroup, called the "universe". This universe can be for instance the semigroup of all functions, partial functions, or relations on the set {1, ..., n}, or the semigroup of n x n matrices with entries in a given finite semiring. The algorithm produces simultaneously a presentation of the semigroup by generators and relations, a confluent rewriting system for this presentation and the Cayley graph of the semigroup. The elements of the semigroups are identified with the reduced words of the rewriting system. We also give some efficient algorithms to compute the Green relations, the local subsemigroups and the syntactic quasi-order of subsets of the semigroup.
Fichier principal
Vignette du fichier
Rio97AMS.pdf (156.09 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00143949 , version 1 (28-04-2007)

Identifiants

  • HAL Id : hal-00143949 , version 1

Citer

Jean-Eric Pin, Véronique Delcroix. Algorithms for computing finite semigroups. Foundations of Computational Mathematics, 1997, Rio de Janeiro, Brazil. pp.112-126. ⟨hal-00143949⟩
212 Consultations
496 Téléchargements

Partager

More