The combinatorial complexity of a finite string (Q5096895)

From MaRDI portal
Revision as of 21:46, 29 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7573199
Language Label Description Also known as
English
The combinatorial complexity of a finite string
scientific article; zbMATH DE number 7573199

    Statements

    title
    The combinatorial complexity of a finite string (English)
    0 references
    author
    Felix Frayman
    0 references
    Valery Kanevsky
    0 references
    Walter W. Kirchherr
    0 references
    publication date
    18 August 2022
    0 references
    cites work
    Q5615282
    0 references
    Q4023085
    0 references
    Q4385509
    0 references
    Q4023358
    0 references
    Q3997095
    0 references

    Identifiers

    zbMATH DE Number
    7573199
    0 references
    OpenAlex ID
    W1526211350
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5096895&oldid=36843908"
    Powered by MediaWiki