Completeness results concerning systolic tree automata and E0L languages (Q674289)

From MaRDI portal
Revision as of 11:34, 27 May 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
Completeness results concerning systolic tree automata and E0L languages
scientific article

    Statements

    title
    Completeness results concerning systolic tree automata and E0L languages (English)
    0 references
    author
    Angelo Monti
    0 references
    Alessandro Roncato
    0 references
    publication date
    28 February 1997
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q42
    0 references
    68Q45
    0 references
    68Q05
    0 references
    zbMATH DE Number
    986045
    0 references
    zbMATH Keywords
    Computational complexity
    0 references
    Formal languages
    0 references
    Tree automata
    0 references
    E0L
    0 references
    PSPACE-completeness
    0 references
    OpenAlex ID
    W2091862052
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q674289&oldid=34177139"
    Powered by MediaWiki