Parameterized complexity of basic decision problems for tree automata (Q2855747)

From MaRDI portal
Revision as of 17:20, 21 August 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
Parameterized complexity of basic decision problems for tree automata
scientific article

    Statements

    Parameterized complexity of basic decision problems for tree automata (English)
    0 references
    0 references
    0 references
    22 October 2013
    0 references
    classical tree automata
    0 references
    rigid tree automata
    0 references
    tree automata with global equality and disequality
    0 references
    t-DAG automata
    0 references
    parameterized complexity theory
    0 references

    Identifiers