论文信息 - Topological dynamics and recognition of languages

Topological dynamics and recognition of languages

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.

Benjamin Steinberg

[1] Jorge Almeida,et al. Finite Semigroups and Universal Algebra , 1995 .

[2] Benjamin Steinberg,et al. The q-theory of Finite Semigroups , 2008 .

[3] Robert Ellis,et al. Lectures in Topological Dynamics , 1969 .

[4] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[5] E. Akin,et al. The Topological Dynamics of Ellis Actions , 2003 .