Definitions and properties of entropy and distance for regular languages

DOI10.1090/conm/736/14845zbMath1478.37019OpenAlexW2974700553MaRDI QIDQ5210870

Austin Parker, Kelly B. Yancey, Matthew P. 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

zbMATH Keywords

deterministic finite automataregular languagesofic shift

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Dynamical aspects of cellular automata (37B15) Topological entropy (37B40) Symbolic dynamics (37B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Similarity in languages and programs
• Computation of distances for regular and context-free probabilistic languages
• On the entropy of regular languages.
• Subshifts of finite type and sofic systems
• Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach
• Finite state languages
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• A Similarity Measure for Cyclic Unary Regular Languages
• 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

This page was built for publication: Definitions and properties of entropy and distance for regular languages