Efficient inclusion checking for deterministic tree automata and XML schemas (Q1041037)

From MaRDI portal
Revision as of 06:07, 2 July 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
Efficient inclusion checking for deterministic tree automata and XML schemas
scientific article

    Statements

    title
    Efficient inclusion checking for deterministic tree automata and XML schemas (English)
    0 references
    author
    Jérôme Champavère
    0 references
    Rémi Gilleron
    0 references
    Aurélien Lemay
    0 references
    Joachim Niehren
    0 references
    publication date
    27 November 2009
    0 references
    zbMATH DE Number
    5639683
    0 references
    zbMATH Keywords
    tree automata
    0 references
    language inclusion
    0 references
    algorithmic complexity
    0 references
    XML shemas
    0 references
    describes a project that uses
    Ltur
    0 references
    Datalog LITE
    0 references
    OpenAlex ID
    W2090802466
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1041037&oldid=35140324"
    Powered by MediaWiki