Reasoning about knowledge
Automata, Languages, and Machines
Automata, Languages, and Machines
Duality and Equational Theory of Regular Languages
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Stone duality and the recognisable languages over an algebra
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
| Hi-index | 0.00 |
The fact that one can associate a finite monoid with universal properties to each language recognised by an automaton is central to the solution of many practical and theoretical problems in automata theory. It is particularly useful, via the advanced theory initiated by Eilenberg and Reiterman, in separating various complexity classes and, in some cases it leads to decidability of such classes. In joint work with Jean-Éric Pin and Serge Grigorieff we have shown that this theory may be seen as a special case of Stone duality for Boolean algebras extended to a duality between Boolean algebras with additional operations and Stone spaces equipped with Kripke style relations. This is a duality which also plays a fundamental role in other parts of the foundations of computer science, including in modal logic and in domain theory. In this talk I will give a general introduction to Stone duality and explain what this has to do with the connection between regular languages and monoids.