Stone Duality and the Recognisable Languages over an Algebra

Autor:	Gehrke, M., Kurz, A., Lenisa, M., Tarlecki, A.
Přispěvatelé:	Kurz, A., Lenisa, M., Tarlecki, A.
Rok vydání:	2009
Předmět:	Algebra Algebra and Topology Finite-state machine Regular language Topological algebra Algebraic theory Duality (mathematics) Distributive lattice Algebra en Topologie Stone duality Lectures Notes in Computer Science Mathematics
Zdroj:	Algebra and Coalgebra in Computer Science ISBN: 9783642037405 CALCO Lectures Notes in Computer Science ; 5728, 236-250. Berlin : Springer STARTPAGE=236;ENDPAGE=250;TITLE=Lectures Notes in Computer Science ; 5728 Kurz, A.; Lenisa, M.; Tarlecki, A. (ed.), Algebra and Coalgebra in Computer Science : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings, pp. 236-250
DOI:	10.1007/978-3-642-03741-2_17
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::46086eb5a7564a96f9d18aa5a1e8046e https://doi.org/10.1007/978-3-642-03741-2_17 Zobrazit plný text záznamu