On the growth rates of complexity of threshold languages (Q5190085): 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: W2111471998 / 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: Q4218144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dejean's conjecture holds for N ≥ 27 / 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: Q3959451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / 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: RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Complexity of Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing Complexity Functions of a Language and Its Extendable Part / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:49, 2 July 2024

scientific article; zbMATH DE number 5681095
Language Label Description Also known as
English
On the growth rates of complexity of threshold languages
scientific article; zbMATH DE number 5681095

    Statements

    On the growth rates of complexity of threshold languages (English)
    0 references
    0 references
    0 references
    0 references
    12 March 2010
    0 references
    0 references
    power-free languages
    0 references
    Dejean's conjecture
    0 references
    threshold languages
    0 references
    combinatorial complexity
    0 references
    growth rate
    0 references
    0 references