Exploring the topological entropy of formal languages
Research output: Contribution to journal › Research article › Contributed › peer-review
Contributors
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 ε-free push-down automata with an arbitrary amount of stacks.
Details
| Original language | English |
|---|---|
| Pages (from-to) | 210-226 |
| Number of pages | 17 |
| Journal | Theoretical computer science : the journal of the EATCS |
| Volume | 849 |
| Publication status | Published - Jan 2021 |
| Peer-reviewed | Yes |
External IDs
| Scopus | 85094561267 |
|---|