Ensembles reconnaissables de mots biinfinis
Maurice Nivat, Dominique Perrin · 1982
The purpose of automata theory is to study and classify those properties of words that may be defined by a finite structure, say a finite automaton or a finite monoid. It seems natural to consider the same problem for infinite words. This amounts to studying the asymptotic behaviour of finite automata. As is well-known, this breaks the equivalence between determinism and non-determinism of finite automata.