On the entropy of regular languages.
From MaRDI portal
Publication:1426038
DOI10.1016/S0304-3975(03)00094-XzbMath1058.68068MaRDI QIDQ1426038
Antonio Machì, Fabio Scarabotti, Tullio G. Ceccherini Silberstein
Publication date: 14 March 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Groups, graphs, languages, automata, games and second-order monadic logic, Growth-sensitivity of context-free languages., Definitions and properties of entropy and distance for regular languages, Growth and ergodicity of context-free languages II: The linear case, On the growth of linear languages, Growth and ergodicity of context-free languages
Cites Work
- Non-negative matrices and Markov chains. 2nd ed
- Endomorphisms of symbolic algebraic varieties
- Growth-sensitivity of context-free languages.
- Subshifts of finite type and sofic systems
- On a lemma of Gromov and the entropy of a graph
- On problems related to growth, entropy, and spectrum in group theory
- Growth and ergodicity of context-free languages
- An Introduction to Symbolic Dynamics and Coding
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
