Computing abelian complexity of binary uniform morphic words (Q2629230): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Automatic Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian complexity of infinite words associated with quadratic Parry numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5408177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic abelian complexity of morphic words / rank
 
Normal rank
Property / cites work
 
Property / cites work: ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate jumbled pattern matching in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaled and permuted string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences with minimal block growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrent words with constant abelian complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subword complexities of various classes of deterministic developmental languages without interactions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the subword complexity of DOL languages with a constant distribution / 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: On the subword complexity of m-free DOL languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crucial words and the complexity of some extremal problems for sets of prohibited words / rank
 
Normal rank
Property / cites work
 
Property / cites work: The subword complexity of fixed points of binary uniform morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of abelian equivalence and complexity of infinite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: The abelian complexity of the paperfolding word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexité des facteurs des mots infinis engendrés par morphismes itérés / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balance and abelian complexity of the Tribonacci word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian complexity of minimal subshifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3589628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration and Automatic Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian properties of Parry words / rank
 
Normal rank

Latest revision as of 07:10, 12 July 2024

scientific article
Language Label Description Also known as
English
Computing abelian complexity of binary uniform morphic words
scientific article

    Statements

    Computing abelian complexity of binary uniform morphic words (English)
    0 references
    0 references
    5 July 2016
    0 references
    formal languages
    0 references
    abelian complexity
    0 references
    morphic words
    0 references
    automatic sequences
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references