Computing abelian complexity of binary uniform morphic words (Q2629230)

From MaRDI portal
Revision as of 16:51, 6 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    Identifiers

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