On the computational complexity of P automata (Q876857)

From MaRDI portal
Revision as of 17:43, 25 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the computational complexity of P automata
scientific article

    Statements

    title
    On the computational complexity of P automata (English)
    0 references
    author
    Oscar H. Ibarra
    0 references
    György Vaszil
    0 references
    publication date
    19 April 2007
    0 references
    Mathematics Subject Classification ID
    68Q10
    0 references
    68Q45
    0 references
    68Q15
    0 references
    zbMATH DE Number
    5144826
    0 references
    zbMATH Keywords
    accepting systems
    0 references
    communicating systems
    0 references
    automata
    0 references
    context-sensitive languages
    0 references
    sub-logarithmic space complexity
    0 references
    OpenAlex ID
    W2094727449
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q876857&oldid=34934836"
    Powered by MediaWiki