On the growth rates of complexity of threshold languages (Q5190085)

From MaRDI portal
Revision as of 13:49, 2 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5681095
Language Label Description Also known as
English
On the growth rates of complexity of threshold languages
scientific article; zbMATH DE number 5681095

    Statements

    title
    On the growth rates of complexity of threshold languages (English)
    0 references
    DOI
    10.1051/ita/2010012
    0 references
    author
    Arseny M. Shur
    0 references
    Irina A. Gorbunova
    0 references
    publication date
    12 March 2010
    0 references
    zbMATH DE Number
    5681095
    0 references
    zbMATH Keywords
    power-free languages
    0 references
    Dejean's conjecture
    0 references
    threshold languages
    0 references
    combinatorial complexity
    0 references
    growth rate
    0 references
    OpenAlex ID
    W2111471998
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5190085&oldid=35155836"
    Powered by MediaWiki