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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Almeida, J.: Finite Semigroups and Universal Algebra. World Scientific, Singapore (1994)
Dekkers, M.: Stone duality: An application in the theory of formal languages, Master’s thesis, Radboud Universiteit Nijmegen, the Netherlands (December 2008)
Gehrke, M., Grigorieff, S., Pin, J.-É.: Duality and equational theory of regular languages. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 246–257. Springer, Heidelberg (2008)
Gehrke, M., Jónsson, B.: Bounded distributive lattices expansions. Mathematica Scandinavica 94(2), 13–45 (2004)
Gehrke, M., Priestley, H.A.: Canonical extensions of certain algebras with binary operations, J. Pure Appl. Alg. 209, 269–290 (2007)
Gehrke, M., Priestley, H.A.: Duality for certain algebras with binary operations via their canonical extensions. Stud. Log. 86(1), 31–68 (2007)
Goldblatt, R.: Varieties of complex algebras. APAL 44, 173–242 (1989)
Hindman, N., Strauss, D.: Algebra in the Stone-Čech compactification. de Gruyter Expositions in Mathematics, vol. 27. de Gruyter & Co., Berlin (1998)
Jónsson, B., Tarski, A.: Boolean algebras with operators I. Amer. J. Math. 73, 891–939 (1951)
Pin, J.-E.: Profinite Methods in Automata Theory. In: Albers, Marion (eds.) STACS 2009, Schloss Dagstuhl. Leibniz International Proceedings in Informatics, vol. 3, pp. 31–50 (2009)
Pippenger, N.: Regular Languages and Stone Duality. Theory Comput. Syst. 30(2), 121–134 (1997)
Rabin, M.O., Scott, D.: Finite automata and their decision problems. Journal of IBM 3, 114–125 (1959)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gehrke, M. (2009). Stone Duality and the Recognisable Languages over an Algebra. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds) Algebra and Coalgebra in Computer Science. CALCO 2009. Lecture Notes in Computer Science, vol 5728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03741-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-03741-2_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03740-5
Online ISBN: 978-3-642-03741-2
eBook Packages: Computer ScienceComputer Science (R0)