SEMIGROUPS WITH IDEMPOTENT STABILIZERS AND APPLICATIONS TO AUTOMATA THEORY

DOI10.1142/S0218196791000195zbMath0725.20043OpenAlexW2006654895MaRDI QIDQ5203242

Jean-Eric Pin, Bertrand Le Saëc, Pascal Weil

Publication date: 1992

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196791000195

zbMATH Keywords

idempotentssemidirect productsinfinite wordsMal'cev productstransition semigroupsnon-deterministic automata\(\mathcal R\)-trivial semigroupsRhodes expansionsright stabilizerseffectively constructible finite semigroupslocal finiteness of semigroupspath congruences

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General structure theory for semigroups (20M10) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (6)

PROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPS ⋮ PRESENTATIONS OF INVERSE SEMIGROUPS, THEIR KERNELS AND EXTENSIONS ⋮ On the minimization problem for ω-automata ⋮ Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups ⋮ Characterizations of rational \(\omega\)-languages by means of right congruences ⋮ Semigroup expansions using the derived category, kernel, and Malcev products

This page was built for publication: SEMIGROUPS WITH IDEMPOTENT STABILIZERS AND APPLICATIONS TO AUTOMATA THEORY