On the computational complexity of infinite words. (Q1401236)

From MaRDI portal
Revision as of 17:00, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
On the computational complexity of infinite words.
scientific article

    Statements

    title
    On the computational complexity of infinite words. (English)
    0 references
    author
    Pavol Ďuriš
    0 references
    Ján Maňuch
    0 references
    publication date
    17 August 2003
    0 references
    Mathematics Subject Classification ID
    68Q05
    0 references
    68Q15
    0 references
    68Q30
    0 references
    zbMATH DE Number
    1965270
    0 references
    zbMATH Keywords
    Infinite words
    0 references
    Computational complexity
    0 references
    dgsm
    0 references
    Double and Triple D0L TAG systems
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1401236&oldid=13558597"
    Powered by MediaWiki