Computing abelian complexity of binary uniform morphic words (Q2629230)

From MaRDI portal
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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    formal languages
    0 references
    abelian complexity
    0 references
    morphic words
    0 references
    automatic sequences
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references