Exploring the Topological Entropy of Formal Languages
classification
💻 cs.FL
cs.CC
keywords
entropytopologicalformallanguagesacceptedamountarbitraryautomata
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.