2000 character limit reached
Topological dynamics and recognition of languages
Published 6 Jun 2013 in cs.FL, math.CO, and math.GR | (1306.1468v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.