Stone Duality and the Recognisable Languages over an Algebra

Abstract. This is a theoretical paper giving the extended Stone duality perspective on the recently discovered connection between duality theory as studied in non-classical logic and theoretical computer science and the algebraic theory of finite state automata. As a bi-product we obtain a general result about profinite completion, namely, that it is the dual under extended Stone duality of the recognisable languages over the original algebra equipped with certain residuation operations.

• Type: Conference
• Year: 2009
• Where: CALCO
• Authors: Mai Gehrke
• Keywords: CALCO 2009, Duality Theory, Extended Stone Duality, Mathematics, Stone Duality Perspective