Definitions and properties of entropy and distance for regular languages
From MaRDI portal
Publication:5210870
DOI10.1090/CONM/736/14845zbMATH Open1478.37019OpenAlexW2974700553MaRDI QIDQ5210870
Austin Parker, Matthew Yancey, Kelly Yancey
Publication date: 22 January 2020
Published in: Dynamical Systems and Random Processes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/conm/736/14845
Formal languages and automata (68Q45) Symbolic dynamics (37B10) Dynamical aspects of cellular automata (37B15) Topological entropy (37B40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Mathematical Theory of Communication
- Subshifts of finite type and sofic systems
- On Li-Yorke pairs
- An Introduction to Symbolic Dynamics and Coding
- Finite state languages
- Similarity in languages and programs
- On the entropy of context-free languages
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach
- Computation of distances for regular and context-free probabilistic languages
- On the entropy of regular languages.
- On the Computation of Some Standard Distances Between Probabilistic Automata
- Expansions of Sums of Matrix Powers
- Conditional densities of regular languages
- LATIN 2004: Theoretical Informatics
- Regular Language Distance and Entropy
- A Similarity Measure for Cyclic Unary Regular Languages
This page was built for publication: Definitions and properties of entropy and distance for regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5210870)
