Concatenation product: a survey

2006 ◽  
pp. 120-137 ◽  
Author(s):  
Pascal Weil
Keyword(s):  
Concatenation Product

scholarly journals Actions, wreath products of C-varieties and concatenation product

2006 ◽  
Vol 356 (1-2) ◽  
pp. 73-89 ◽  
Author(s):  
Laura Chaubard ◽  
Jean-Éric Pin ◽  
Howard Straubing
Keyword(s):  
Wreath Products ◽  
Concatenation Product

scholarly journals THE BIDETERMINISTIC CONCATENATION PRODUCT

1993 ◽  
Vol 03 (04) ◽  
pp. 535-555 ◽  
Author(s):  
JEAN-ERIC PIN ◽  
DENIS THÉRIEN
Keyword(s):  
Inverse Image ◽  
Algebraic Characterization ◽  
Commutative Monoids ◽  
Nilpotent Semigroup ◽  
Expansion Formula ◽  
Regular Elements ◽  
Malcev Product ◽  
Algebraic Description ◽  
Concatenation Product

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, [Formula: see text] the corresponding variety of languages and [Formula: see text] the smallest variety containing [Formula: see text] and the bideterministic products of two languages of [Formula: see text]. We give an algebraic description of the variety of monoids [Formula: see text] corresponding to [Formula: see text]. For instance, we compute [Formula: see text] 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 ℛ-trivial and idemptotent 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 [Formula: see text]-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 [Formula: see text] makes use of a construction which associates to any finite monoid M an expansion [Formula: see text] with the following properties: (1) M is a quotient of [Formula: see text] (2) the morphism [Formula: see text] induces an isomorphism between the submonoids of [Formula: see text] and of M generated by the regular elements and (3) the inverse image under π of an idempotent of M is a 2-nilpotent semigroup.

The Kernel Category and Variants of the Concatenation Product

1997 ◽  
Vol 07 (04) ◽  
pp. 487-509 ◽  
Author(s):  
Mário J. J. Branco
Keyword(s):  
Boolean Algebra ◽  
Finite Monoids ◽  
Concatenation Product ◽  
Relational Morphism

For each variety V of finite monoids, we consider three varieties [Formula: see text] of languages defined in the following way: for each alphabet [Formula: see text] is the Boolean algebra generated by the languages of the form L or L0aL1, where [Formula: see text], a ∈ A and the product L0aL1 is deterministic (resp. codeterministic, bideterministic). We present a description of the corresponding varieties of finite monoids. Such descriptions are done in terms of categories, using the kernel category of a relational morphism. We also give some connections with the positive varieties of languages and with the varieties of finite ordered monoids.

scholarly journals A conjecture on the concatenation product

2001 ◽  
Vol 35 (6) ◽  
pp. 597-618 ◽  
Author(s):  
Jean-Eric Pin ◽  
Pascal Weil
Keyword(s):  
Concatenation Product
Sign in / Sign up

Export Citation Format

Share Document