déposer
version française rss feed
HAL : hal-00020072, version 1

Fiche détaillée  Récupérer au format
International Journal of Algebra and Computation 3 (1993) 535-555
The bideterministic concatenation product
Jean-Eric Pin 1, Denis Thérien 2
(1993)

This paper is devoted to the study of the bideterministic concatenation product, a variant of the concatenation product. We give an algebraic characterization of the varieties of languages closed under this product. More precisely, let V be a variety of monoids, V the corresponding variety of languages and W the smallest variety containing V and the bideterministic products of two languages of V. We give an algebraic description of the variety of monoids W corresponding to W. For instance, we compute W when V is one of the following varieties : the variety of idempotent and commutative monoids, the variety of monoids which are semilattices of groups of a given variety of groups, the variety of R-trivial and idempotent monoids. In particular, we show that the smallest variety of languages closed under bideterministic product and containing the language {1}, corresponds to the variety of J-trivial monoids with commuting idempotents. Similar results were known for the other variants of the concatenation product, but the corresponding algebraic operations on varieties of monoids were based on variants of the semidirect product and of the Malcev product. Here the operation V -> W makes use of a construction which associates to any finite monoid M an expansion N, with the following properties: (1) M is a quotient of N, (2) the morphism f : N -> M induces an isomorphism between the submonoids of N and of M generated by the regular elements and (3) the inverse image under f of an idempotent of M is a 2-nilpotent semigroup.
1 :  Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA)
CNRS : UMR7089 – Université Paris VII - Paris Diderot
2 :  McGill University (McGill)
McGill University
Automates et Applications
Mathématiques/Théorie des groupes

Informatique/Mathématique discrète
concatenation product – formal languages – finite semigroups
Liste des fichiers attachés à ce document : 
PDF
PinTherien.pdf(189.7 KB)

tous les articles de la base du CCSd...
tous les articles de la base du CCSd...
tous les articles de la base du CCSd...
tous les articles de la base du CCSd...
tous les articles de la base du CCSd...
tous les articles de la base du CCSd...
tous les articles de la base du CCSd...
tous les articles de la base du CCSd...
tous les articles de la base du CCSd...
tous les articles de la base du CCSd...
tous les articles de la base du CCSd...
tous les articles de la base du CCSd...
tous les articles de la base du CCSd...
tous les articles de la base du CCSd...
tous les articles de la base du CCSd...
tous les articles de la base du CCSd...
tous les articles de la base du CCSd...
tous les articles de la base du CCSd...
tous les articles de la base du CCSd...
tous les articles de la base du CCSd...