Corpus ID: 23112149

# Topological Entropy of Formal Languages

@article{Starke2018TopologicalEO,
title={Topological Entropy of Formal Languages},
author={Florian Starke},
journal={ArXiv},
year={2018},
volume={abs/1801.07321}
}
• Florian Starke
• Published 22 January 2018
• Computer Science, Mathematics
• ArXiv
In this thesis we will introduce topological automata and the topological entropy of a topological automaton, which is the topological entropy of the dynamical system contained in the automaton. We will use these notions to define a measure of complexity for formal languages. We assign to every language the topological entropy of the unique minimal topological automaton accepting it. We contribute several new results. We use a preexisting characterization of the topological entropy of a formal… Expand
1 Citations
Exploring the topological entropy of formal languages
It is shown 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. Expand

#### References

SHOWING 1-6 OF 6 REFERENCES
Topological entropy of formal languages
• Mathematics
• 2015
We introduce the notion of topological entropy of a formal language as the topological entropy of the minimal topological automaton accepting it. Using a characterization of this notion in terms ofExpand
Topological dynamics and recognition of languages
It is shown that every language has a unique minimal compact automaton and recognition of languages by compact left semitopological monoids and the analogue of the syntactic monoid is constructed. Expand
Introduction to Automata Theory, Languages and Computation
• Computer Science
• 1979
This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments. Expand
State Complexity of Regular Languages
• Sheng Yu
• Mathematics, Computer Science
• J. Autom. Lang. Comb.
• 2001
This work investigates the problems related to the state complexity of regular languages and their operations and compares the results on regular languages with those on nite languages. Expand
Term rewriting and all that
• Mathematics, Computer Science
• 1998
This chapter discusses abstract reduction systems, universal algebra, and Grobner bases and Buchberger's algorithm, and a bluffer's guide to ML Bibliography Index. Expand