Exploring the Topological Entropy of Formal Languages
Formal Languages and Automata Theory
2019-04-25 v2 Computational Complexity
Abstract
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 {\epsilon}-free push-down automata with an arbitrary amount of stacks.
Keywords
Cite
@article{arxiv.1801.07321,
title = {Exploring the Topological Entropy of Formal Languages},
author = {Florian Starke},
journal= {arXiv preprint arXiv:1801.07321},
year = {2019}
}
Comments
22 pages