Branching frequency and Markov entropy of repetition-free languages
From MaRDI portal
Publication:832956
DOI10.1007/978-3-030-81508-0_27OpenAlexW3197010017MaRDI QIDQ832956FDOQ832956
Authors: Elena A. Petrova, Arseny M. Shur 
Publication date: 25 March 2022
Full work available at URL: https://arxiv.org/abs/2105.02750
Cites Work
- A Mathematical Theory of Communication
- Disjointness in ergodic theory, minimal sets, and a problem in diophantine approximation
- Probability on trees and networks
- Title not available (Why is that?)
- On Abelian repetition threshold
- Two-Sided Bounds for the Growth Rates of Power-Free Languages
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Online Detection of Repetitions with Backtracking
- Strongly non-repetitive sequences and progression-free sets
- Abelian squares are avoidable on 4 letters
- Combinatorial Complexity of Regular Languages
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- On Dejean's conjecture over large alphabets
- Sur un théorème de Thue
- A proof of Dejean’s conjecture
- Last cases of Dejean's conjecture
- Dejean's conjecture and Sturmian words
- Growth rates of complexity of power-free languages
- Title not available (Why is that?)
- Growth properties of power-free languages
- On the growth rates of complexity of threshold languages
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
- Generalized Kraft Inequality and Arithmetic Coding
- On the number of Abelian square-free words on four letters
- The number of binary words avoiding Abelian fourth powers grows exponentially
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)
