Eilenberg Theorems for Free

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 algebraic language theory. We show that they all arise from the same recipe: one models languages and the algebras recognizing them by monads on an algebraic category, and applies a Stone-type duality. Our main contribution is a variety theorem that covers e. g. Wilke's and Pin's work on infinity-languages, the variety theorem for cost functions of Daviaud, Kuperberg, and Pin, and unifies the two categorical approaches of Bojanczyk and of Adamek et al. In addition we derive new results, such as an extension of the local variety theorem of Gehrke, Grigorieff, and Pin from finite to infinite words.

Authors

• Henning Urbat
• Jirí Adámek
• Liang-Ting Chen 0001
• Stefan Milius

Keywords

• Eilenberg&#039
• s theorem
• variety of languages
• pseudovariety
• monad
• duality