The Kolmogorov complexity of infinite words (Q2383593)

From MaRDI portal
Revision as of 07:42, 18 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Kolmogorov complexity of infinite words
scientific article

    Statements

    title
    The Kolmogorov complexity of infinite words (English)
    0 references
    author
    Ludwig Staiger
    0 references
    publication date
    19 September 2007
    0 references
    zbMATH Keywords
    Kolmogorov complexity
    0 references
    entropy of languages
    0 references
    \(\omega \)-languages
    0 references
    Hausdorff dimension
    0 references
    packing dimension
    0 references
    box-counting dimensions
    0 references
    subword complexity
    0 references
    cites work
    STACS 2004
    0 references
    Q4071156
    0 references
    Q4806962
    0 references
    On partial randomness
    0 references
    Finite state languages
    0 references
    Q3214803
    0 references
    Q4337021
    0 references
    Q2754206
    0 references
    Q5603915
    0 references
    Q5573961
    0 references
    Q3705346
    0 references
    Q3926038
    0 references
    Q3030812
    0 references
    Q4714446
    0 references
    Q4385530
    0 references
    Q4485693
    0 references

    Identifiers

    zbMATH DE Number
    5192265
    0 references
    OpenAlex ID
    W1997534682
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2383593&oldid=39046697"
    Powered by MediaWiki