Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories (Q4927423)

From MaRDI portal
Revision as of 20:44, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6177461
Language Label Description Also known as
English
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
scientific article; zbMATH DE number 6177461

    Statements

    Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 June 2013
    0 references
    tree automata
    0 references
    tree languages
    0 references
    XML processing
    0 references
    symbolic constraints
    0 references
    decidability
    0 references
    monadic second-order logic
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references