Tree automata with equality constraints modulo equational theories (Q2426520)

From MaRDI portal
Revision as of 11:26, 4 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
Tree automata with equality constraints modulo equational theories
scientific article

    Statements

    Tree automata with equality constraints modulo equational theories (English)
    0 references
    0 references
    0 references
    0 references
    22 April 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    first-order theorem proving
    0 references
    tree automata
    0 references
    basic paramodulation
    0 references
    splitting
    0 references
    verification of infinite state systems
    0 references