Stone duality in the theory of formal languages

Formal languages are mathematical models of computing machines and have strong connections to logic and, in the setting of regular languages, to topological algebra — a double connection which is governed by Stone duality. In this talk I will survey this connection and its potential applications in Boolean circuit complexity.