We introduce the notions of topological entropy of a formal language and of a topological automaton. We show that the entropy function is surjective and bound the entropy of languages accepted by deterministic ε-free push-down automata with an arbitrary amount of stacks.

中文翻译：

---

探索形式语言的拓扑熵

我们介绍形式语言和拓扑自动机的拓扑熵的概念。我们证明了熵函数是排斥性的，并且用任意数量的堆栈来限制确定性无ε下推自动机接受的语言的熵。