The Kernel Category and Variants of the Concatenation Product
1997 ◽
Vol 07
(04)
◽
pp. 487-509
◽
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.
2005 ◽
Vol 64
(9)
◽
pp. 699-712
Keyword(s):
Keyword(s):
2001 ◽
Vol 40
(4)
◽
pp. 243-254
◽
Keyword(s):
Keyword(s):