11 citations · 36 across the 25 of their papers we have counts for
5 papers · 1 filter
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…
A Fibrational Approach to Automata Theory
Liang-Ting Chen, Henning Urbat
For predual categories C and D we establish isomorphisms between opfibrations representing local varieties of languages in C, local pseudovarieties of D-monoids, and finitely gener…
Syntactic Monoids in a Category
Jiri Adamek, Stefan Milius, Henning Urbat
The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category D. This allows for a uniform treatment of several notions of syntactic algebr…
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…