Duality and the equational theory of regular languages.
zbMATH Open1302.08010MaRDI QIDQ2874893FDOQ2874893
Authors: Yann Pequignot 
Publication date: 12 August 2014
Recommendations
Stone dualityBoolean algebrasEilenberg variety theoremvarieties of finite monoidsStone spacesprofinite equationsvarieties of regular languagesprofinite monoids
Algebraic theory of languages and automata (68Q70) Applications of universal algebra in computer science (08A70) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35) Stone spaces (Boolean spaces) and related structures (06E15)
Cited In (16)
- Stone duality and the substitution principle
- Title not available (Why is that?)
- Duality and recognition
- Stone duality and the recognisable languages over an algebra
- Generalized Eilenberg theorem. I: Local varieties of languages
- Regular varieties of automata and coequations
- Difference hierarchies and duality with an application to formal languages
- Regular binoid expressions and regular binoid languages.
- A Logical Descriptor for Regular Languages via Stone Duality
- Equational descriptions of languages
- Classes of languages generated by the Kleene star of a word
- Stone duality, topological algebra, and recognition.
- Duality in computer science
- Equational descriptions of languages
- Duality and Equational Theory of Regular Languages
- The equational theory of regular words
This page was built for publication: Duality and the equational theory of regular languages.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874893)
