Pages that link to "Item:Q1426038"
From MaRDI portal
The following pages link to On the entropy of regular languages. (Q1426038):
Displaying 11 items.
- Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions (Q410708) (← links)
- Groups, graphs, languages, automata, games and second-order monadic logic (Q444388) (← links)
- On the growth of linear languages (Q817237) (← links)
- Ein Satz über die Entropie von Untermonoiden. (A theorem on the entropy of submonoids) (Q1113684) (← links)
- Growth-sensitivity of context-free languages. (Q1426039) (← links)
- Generalised entropies and asymptotic complexities of languages (Q2252524) (← links)
- Topological entropy of formal languages (Q2362264) (← links)
- Growth and ergodicity of context-free languages (Q3151247) (← links)
- Growth and ergodicity of context-free languages II: The linear case (Q3420282) (← links)
- Definitions and properties of entropy and distance for regular languages (Q5210870) (← links)
- Finitely generated subgroups of free groups as formal languages and their cogrowth (Q6566726) (← links)