Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata (Q3172918)

From MaRDI portal
Revision as of 15:40, 1 September 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata
scientific article

    Statements

    Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 October 2011
    0 references

    Identifiers