arXiv · 1507.03393
Topological Entropy of Formal Languages
Abstract
We introduce the notion of topological entropy of a formal languages as the topological entropy of the minimal topological automaton accepting it. Using a characterization of this notion in terms of approximations of the Myhill-Nerode congruence relation, we are able to compute the topological entropies of certain example languages. Those examples suggest that the notion of a "simple" formal language coincides with the language having zero entropy.
Explore related subjects
Keep this discovery
Friedrich Martin Schneider, Daniel Borchmann. 2015-07-13. Topological Entropy of Formal Languages. https://doi.org/10.1007/s00233-016-9782-0
Cite the original work for its findings. Save a collection to share your selection of sources.