Languages under substitutions and balanced words (Q558187): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and special factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences with minimal block growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness Theorems for Periodic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4784598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4876647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some combinatorial properties of Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of factors of Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sturmian morphisms and Rauzy's rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic Dynamics II. Sturmian Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intertwinings of periodic sequences / rank
 
Normal rank

Latest revision as of 13:13, 10 June 2024

scientific article
Language Label Description Also known as
English
Languages under substitutions and balanced words
scientific article

    Statements

    Languages under substitutions and balanced words (English)
    0 references
    0 references
    0 references
    30 June 2005
    0 references
    The author studies binary languages and their images under substitutions. He gives a formula describing bispecial factors of the images of languages under substitutions. He applies the formula to get some information about the complexities of the language of balanced words and its image.
    0 references
    0 references
    substitutions
    0 references
    subword complexity
    0 references
    balanced word
    0 references
    0 references