arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1507.03393math.DS
收藏

Topological Entropy of Formal Languages

Friedrich Martin Schneider, Daniel Borchmann

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑