The subword complexity of fixed points of binary uniform morphisms (Q5055933): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4852852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of factors in the Thue-Morse word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5486009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4345303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: If a DOL language is k-power free then it is circular / 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: Reconnaissabilité des substitutions et complexité des suites automatiques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata calculating the complexity of automatic sequences / rank
 
Normal rank

Latest revision as of 02:02, 31 July 2024

scientific article; zbMATH DE number 7631370
Language Label Description Also known as
English
The subword complexity of fixed points of binary uniform morphisms
scientific article; zbMATH DE number 7631370

    Statements

    Identifiers