Growth rates of complexity of power-free languages (Q986556): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3395963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly growing k-th power-free homomorphisms / 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: Automata and forbidden words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4327350 / 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: The number of binary cube-free words of length up to 47 and their numerical analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5562645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems in algebraic combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial versus exponential growth in repetition-free binary words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetition-free words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of irreducible binary words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3689370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the entropy and letter frequencies of ternary square-free words / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of the set of cube-free $ Z$-words in a two-letter alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing Complexity Functions of a Language and Its Extendable Part / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Complexity of Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Dejean’s conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Last cases of Dejean's conjecture / rank
 
Normal rank

Latest revision as of 02:30, 3 July 2024

scientific article
Language Label Description Also known as
English
Growth rates of complexity of power-free languages
scientific article

    Statements

    Growth rates of complexity of power-free languages (English)
    0 references
    0 references
    11 August 2010
    0 references
    0 references
    growth rate
    0 references
    regular language
    0 references
    power-free language
    0 references
    finite antidictionary
    0 references
    0 references
    0 references