  We define compact automata and show that every language has a unique minimal
compact automaton. We also define recognition of languages by compact left
semitopological monoids and construct the analogue of the syntactic monoid in
this context. For rational languages this reduces to the usual theory of finite
automata and finite monoids.
