Branching frequency and Markov entropy of repetition-free languages (Q832956): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3197010017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of Abelian square-free words on four letters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Dejean's conjecture over large alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of binary words avoiding Abelian fourth powers grows exponentially / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Dejean’s conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur un théorème de Thue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly non-repetitive sequences and progression-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjointness in ergodic theory, minimal sets, and a problem in diophantine approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian squares are avoidable on 4 letters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Detection of Repetitions with Backtracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability on Trees and Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dejean's conjecture and Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters / rank
 
Normal rank
Property / cites work
 
Property / cites work: A propos d'une conjecture de F. Dejean sur les répétitions dans les mots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Last cases of Dejean's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Kraft Inequality and Arithmetic Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Abelian repetition threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Complexity of Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Sided Bounds for the Growth Rates of Power-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth rates of complexity of power-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth properties of power-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the growth rates of complexity of threshold languages / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:07, 28 July 2024

scientific article
Language Label Description Also known as
English
Branching frequency and Markov entropy of repetition-free languages
scientific article

    Statements

    Branching frequency and Markov entropy of repetition-free languages (English)
    0 references
    0 references
    0 references
    25 March 2022
    0 references
    power-free language
    0 references
    abelian-power-free language
    0 references
    Markov entropy
    0 references
    prefix tree
    0 references
    random walk
    0 references
    0 references
    0 references

    Identifiers