Decompositions of automata and transition semigroups
Acta Cybernetica
Automata, Languages, and Machines
Automata, Languages, and Machines
Classifying Regular Languages by their Syntactic Algebras
Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science
Varieties of tree languages definable by syntactic monoids
Acta Cybernetica
Myhill--Nerode type theory for fuzzy languages and automata
Fuzzy Sets and Systems
Characteristic semigroups of directable automata
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Hi-index | 0.00 |
In the triangle consisting of automata, languages and semigroups various correspondences of Eilenberg's type between languages and semigroups and between automata and languages are known, and it remains to establish similar connections between automata and semigroups. In this paper we consider a more general case by taking unary X-algebras instead of automata and we establish complete lattice isomorphisms between the lattices of σ-varieties of X-algebras, κ-varieties of semigroups and weakly invariant congruences on the free semigroup X+, where κ is the cardinality of X, between the lattices of generalized σ-varieties of X-algebras, generalized κ-varieties of semigroups and filters of the lattice of weakly invariant congruences on X+, and between the lattices of pseudo-σ-varieties of X-algebras and pseudo-κ-varieties of semigroups.