Types of varieties of recognizable \(\omega\)-languages and Eilenberg correspondences. (Q1431401)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Types of varieties of recognizable \(\omega\)-languages and Eilenberg correspondences. |
scientific article; zbMATH DE number 2070753
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Types of varieties of recognizable \(\omega\)-languages and Eilenberg correspondences. |
scientific article; zbMATH DE number 2070753 |
Statements
Types of varieties of recognizable \(\omega\)-languages and Eilenberg correspondences. (English)
0 references
8 June 2004
0 references
A class \(\underline V\) of finite monoids is called an \(M\)-variety if it satisfies the condition: for any monoids \(M,N\in\underline V\) and any monoid \(P\), if \(P\prec M\times N\) then also \(P \in\underline V\). Here \(P\prec M\times N\) means that \(P\) is a homomorphic image of a submonoid of the direct product \(M\times N\). The author then defines \(\omega\)-varieties and \(L\)-varieties that are related to recognizable subsets and Boolean closures, and it is shown that the correspondences \(\underline V\Rightarrow V^\omega\) and \(\underline V\Rightarrow\vec V\) from the class of \(M\)-varieties to the class of all \(\omega\)-varieties and the class of \(L\)-varieties of recognizable \(\omega\)-languages, respectively, are one-to-one.
0 references
\(\omega\)-languages
0 references
varieties
0 references
regular languages
0 references
finite semigroups
0 references
syntactic monoids
0 references