IBP-Litp
1996/37:
Rapport de Recherche Litp /
Litp research reports
18 pages - Décembre/December 1996 -
Document en anglais.
PostScript : Ko /Kb
Titre / Title: Algorithms for computing finite semigroups
Abstract : 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 a finite set, 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 semigroup 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 a subset of the semigroup.
Publications internes Litp 1996 / Litp research reports 1996