On the computational complexity of P automata (Q876857)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the computational complexity of P automata
scientific article

    Statements

    On the computational complexity of P automata (English)
    0 references
    0 references
    0 references
    19 April 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    accepting systems
    0 references
    communicating systems
    0 references
    automata
    0 references
    context-sensitive languages
    0 references
    sub-logarithmic space complexity
    0 references
    0 references