45 citations · 118 across the 19 of their papers we have counts for
4 papers · 1 filter
Eilenberg Theorems for Free
Henning Urbat, Jiří Adámek, Liang-Ting Chen +1
Eilenberg-type correspondences, relating varieties of languages (e.g. of finite words, infinite words, or trees) to pseudovarieties of finite algebras, form the backbone of algebra…
Profinite Monads, Profinite Equations, and Reiterman's Theorem
Liang-Ting Chen, Jiri Adamek, Stefan Milius +1
Profinite equations are an indispensable tool for the algebraic classification of formal languages. Reiterman's theorem states that they precisely specify pseudovarieties, i.e. cla…
Varieties of Languages in a Category
Jiri Adamek, Stefan Milius, Robert Myers +1
Eilenberg's variety theorem, a centerpiece of algebraic automata theory, establishes a bijective correspondence between varieties of languages and pseudovarieties of monoids. In th…
Generalized Eilenberg Theorem I: Local Varieties of Languages
Jiri Adamek, Stefan Milius, Robert Myers +1
We investigate the duality between algebraic and coalgebraic recognition of languages to derive a generalization of the local version of Eilenberg's theorem. This theorem states th…