Stone Duality and the Recognisable Languages over an Algebra

DOI10.1007/978-3-642-03741-2_17zbMath1239.68047OpenAlexW2156316905MaRDI QIDQ2888490

Mai Gehrke

Publication date: 1 June 2012

Published in: Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03741-2_17

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Lattices and duality (06D50)

Related Items (9)

TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES ⋮ The dual equivalence of equations and coequations for automata ⋮ Algebra-coalgebra duality in brzozowski's minimization algorithm ⋮ Anatomy of a domain of continuous random variables. I ⋮ From Haar to Lebesgue via Domain Theory ⋮ Anatomy of a Domain of Continuous Random Variables II ⋮ A categorical duality for algebras of partial functions ⋮ Stone duality, topological algebra, and recognition. ⋮ Canonical Extensions, Esakia Spaces, and Universal Models

Cites Work

• Unnamed Item
• Unnamed Item
• Regular languages and Stone duality
• Canonical extensions of double quasioperator algebras: an algebraic perspective on duality for certain algebras with binary operations
• Algebra in the Stone-Čech compactification: theory and applications
• Duality for double quasioperator algebras via their canonical extensions
• Varieties of complex algebras
• Duality and Equational Theory of Regular Languages
• Bounded distributive lattice expansions
• Profinite Methods in Automata Theory
• Boolean Algebras with Operators. Part I

This page was built for publication: Stone Duality and the Recognisable Languages over an Algebra