The complexity of tree automata and XPath on grammar-compressed trees (Q860863)

From MaRDI portal
Revision as of 12:17, 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
The complexity of tree automata and XPath on grammar-compressed trees
scientific article

    Statements

    title
    The complexity of tree automata and XPath on grammar-compressed trees (English)
    0 references
    author
    Markus Lohrey
    0 references
    Sebastian Maneth
    0 references
    publication date
    9 January 2007
    0 references
    Mathematics Subject Classification ID
    68Q45
    0 references
    68Q17
    0 references
    68Q25
    0 references
    68Q42
    0 references
    zbMATH DE Number
    5083509
    0 references
    zbMATH Keywords
    tree automata
    0 references
    XPath
    0 references
    tree compression
    0 references
    OpenAlex ID
    W2148149459
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q860863&oldid=34910876"
    Powered by MediaWiki