Definitions and properties of entropy and distance for regular languages
From MaRDI portal
Publication:5210870
Recommendations
Cites work
- scientific article; zbMATH DE number 3140804 (Why is no real title available?)
- scientific article; zbMATH DE number 3140805 (Why is no real title available?)
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 1849966 (Why is no real title available?)
- A Mathematical Theory of Communication
- A Similarity Measure for Cyclic Unary Regular Languages
- An Introduction to Symbolic Dynamics and Coding
- Computation of distances for regular and context-free probabilistic languages
- Conditional densities of regular languages
- Expansions of Sums of Matrix Powers
- Finite state languages
- Information rate of some classes of non-regular languages: an automata-theoretic approach (extended abstract)
- LATIN 2004: Theoretical Informatics
- On Li-Yorke pairs
- On the Computation of Some Standard Distances Between Probabilistic Automata
- On the entropy of context-free languages
- On the entropy of regular languages.
- Regular language distance and entropy
- Similarity in languages and programs
- Subshifts of finite type and sofic systems
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
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)