If a DOL language is k-power free then it is circular (Q4630287): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-56939-1_98 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1550216888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3860007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714479 / 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 the size of a square-free morphism on a three letter alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3700854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp characterizations of squarefree morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the subword complexity of square-free DOL languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetition of subwords in DOL languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the periodicity of morphisms on free monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valeurs propres des systèmes dynamiques définis par des substitutions de longueur variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cube-free \(\omega\)-words generated by binary morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm to decide whether a binary word contains an overlap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3687735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of power-free morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal flows arising from substitutions of non-constant length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite words with linear subword complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetitions in the Fibonacci infinite word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power of words and recognizability of fixpoints of a substitution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Substitution dynamical systems - spectral analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3689370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences generated by infinitely iterated morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4746787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948609 / rank
 
Normal rank

Latest revision as of 23:41, 18 July 2024

scientific article; zbMATH DE number 7045139
Language Label Description Also known as
English
If a DOL language is k-power free then it is circular
scientific article; zbMATH DE number 7045139

    Statements

    If a DOL language is k-power free then it is circular (English)
    0 references
    0 references
    0 references
    29 March 2019
    0 references
    fractional power
    0 references
    free monoids
    0 references
    pigeon hole principle
    0 references
    rank zero
    0 references
    formal language theory
    0 references

    Identifiers