Computing abelian complexity of binary uniform morphic words (Q2629230)

From MaRDI portal
Revision as of 11:22, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Computing abelian complexity of binary uniform morphic words
scientific article

    Statements

    title
    Computing abelian complexity of binary uniform morphic words (English)
    0 references
    author
    Yanyan Li
    0 references
    publication date
    5 July 2016
    0 references
    zbMATH Keywords
    formal languages
    0 references
    abelian complexity
    0 references
    morphic words
    0 references
    automatic sequences
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R15
    0 references
    11B85
    0 references
    68Q45
    0 references
    68W32
    0 references
    68W40
    0 references
    zbMATH DE Number
    6600959
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2629230&oldid=15431245"
    Powered by MediaWiki