Regular Language Distance and Entropy

DOI10.4230/LIPIcs.MFCS.2017.3zbMath1440.68161arXiv1602.07715OpenAlexW2963255148MaRDI QIDQ5111217

Kelly B. Yancey, Austin Parker, Matthew P. Yancey

Publication date: 26 May 2020

Full work available at URL: https://arxiv.org/abs/1602.07715

zbMATH Keywords

entropysymbolic dynamicsregular languageschannel capacityJaccard distance

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Measures of information, entropy (94A17) Topological entropy (37B40) Symbolic dynamics (37B10)

Related Items (2)

Regular Language Distance and Entropy ⋮ Definitions and properties of entropy and distance for regular languages

Cites Work

• A Mathematical Theory of Communication
• Similarity in languages and programs
• Computation of distances for regular and context-free probabilistic languages
• Topological entropy of formal languages
• Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• A Similarity Measure for Cyclic Unary Regular Languages
• Efficient Computation of the Relative Entropy of Probabilistic Automata
• Expansions of Sums of Matrix Powers
• On Li-Yorke pairs
• An Introduction to Symbolic Dynamics and Coding
• Regular Language Distance and Entropy
• On the entropy of context-free languages
• On the Computation of Some Standard Distances Between Probabilistic Automata
• LATIN 2004: Theoretical Informatics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regular Language Distance and Entropy