Semigroups whith idempotent stabilizers and applications to automata theory - Archive ouverte HAL
Journal Articles International Journal of Algebra and Computation Year : 1991

Semigroups whith idempotent stabilizers and applications to automata theory

Abstract

We show that every finite semigroup is a quotient of a finite semigroup in which every right stabilizer satisfies the identities x = x^2 and xy = xyx. This result has several consequences. We first give a geometrical application : every finite transformation semigroup has a fixpoint-free covering (a transformation semigroup is fixpoint-free if every element which stabilizes a point is idempotent). Next we use our result and a result of I. Simon on congruences on paths to obtain a purely algebraic proof of a deep theorem of McNaughton on infinite words. Finally, we give an algebraic proof of a theorem of Brown on a finiteness condition for semigroups.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
LeSaecPinWeil.pdf (230.5 Ko) Télécharger le fichier
Loading...

Dates and versions

hal-00019824 , version 1 (28-02-2006)

Identifiers

  • HAL Id : hal-00019824 , version 1

Cite

Bertrand Le Saec, Jean-Eric Pin, Pascal Weil. Semigroups whith idempotent stabilizers and applications to automata theory. International Journal of Algebra and Computation, 1991, 1, pp.291-314. ⟨hal-00019824⟩
280 View
325 Download

Share

More