Branching frequency and Markov entropy of repetition-free languages
From MaRDI portal
Publication:832956
Cites work
- scientific article; zbMATH DE number 2186883 (Why is no real title available?)
- scientific article; zbMATH DE number 1161555 (Why is no real title available?)
- A Mathematical Theory of Communication
- A proof of Dejean’s conjecture
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Abelian squares are avoidable on 4 letters
- Combinatorial Complexity of Regular Languages
- Dejean's conjecture and Sturmian words
- Disjointness in ergodic theory, minimal sets, and a problem in diophantine approximation
- Generalized Kraft Inequality and Arithmetic Coding
- Growth properties of power-free languages
- Growth rates of complexity of power-free languages
- Last cases of Dejean's conjecture
- On Abelian repetition threshold
- On Dejean's conjecture over large alphabets
- On the growth rates of complexity of threshold languages
- On the number of Abelian square-free words on four letters
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
- Online detection of repetitions with backtracking
- Probability on trees and networks
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Strongly non-repetitive sequences and progression-free sets
- Sur un théorème de Thue
- The number of binary words avoiding Abelian fourth powers grows exponentially
- Two-Sided Bounds for the Growth Rates of Power-Free Languages
Cited in
(3)
This page was built for publication: Branching frequency and Markov entropy of repetition-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832956)
