Stone duality, topological algebra, and recognition.
DOI10.1016/j.jpaa.2015.12.007zbMath1339.06012arXiv1309.2422OpenAlexW2963267007MaRDI QIDQ5964103
Publication date: 26 February 2016
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.2422
distributive latticesPriestley dualityStone dualityprofinite completionscompact recognitionrecognisable subsets of free monoids
Algebraic theory of languages and automata (68Q70) Lattices and duality (06D50) Semigroups in automata theory, linguistics, etc. (20M35) Stone spaces (Boolean spaces) and related structures (06E15) Other topological algebraic systems and their representations (22A30)
Related Items (15)
Cites Work
- An introduction to quantaloid-enriched categories
- Formations of finite monoids and formal languages: Eilenberg's variety theorem revisited.
- Regular languages and Stone duality
- Priestley style duality for distributive meet-semilattices
- Canonical extensions of double quasioperator algebras: an algebraic perspective on duality for certain algebras with binary operations
- Petri nets, event structures and domains. I
- The Birkhoff theorem for finite algebras
- Domain theory in logical form
- Quasiorders and sublattices of distributive lattices
- A Reiterman theorem for pseudovarieties of finite first-order structures
- The enriched Vietoris monad on representable spaces
- Operations preserving regular languages
- Duality for double quasioperator algebras via their canonical extensions
- Tree acceptors and some of their applications
- Varieties of complex algebras
- Stone Duality and the Recognisable Languages over an Algebra
- Minimization via Duality
- Duality and Recognition
- Duality and Equational Theory of Regular Languages
- A Topological Approach to Recognition
- Equations Defining the Polynomial Closure of a Lattice of Regular Languages
- The Theory of Stabilisation Monoids and Regular Cost Functions
- Bounded distributive lattice expansions
- EQUATIONAL DESCRIPTIONS OF LANGUAGES
- AROUND DOT-DEPTH ONE
- Boolean Algebras of Regular Languages
- Canonical Extensions, Esakia Spaces, and Universal Models
- Profinite Methods in Automata Theory
- Algebra-coalgebra duality in brzozowski's minimization algorithm
- Algebraic automata and context-free sets
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Representation of Distributive Lattices by means of ordered Stone Spaces
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Boolean Algebras with Operators. Part I
- Boolean Algebras with Operators
- Completely Distributive Complete Lattices
- A topology for free groups and related groups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Stone duality, topological algebra, and recognition.