Tree Automata with Equality Constraints Modulo Equational Theories
From MaRDI portal
Publication:3613434
DOI10.1007/11814771_45zbMath1222.03046OpenAlexW2112231066MaRDI QIDQ3613434
Florent Jacquemard, Laurent Vigneron, Michaël Rusinowitch
Publication date: 12 March 2009
Published in: Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00579011/file/rr-lsv-2006-07.pdf
Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42)
Related Items (5)
Protocol Verification Via Rigid/Flexible Resolution ⋮ Tree Automata with Global Constraints ⋮ Superposition for Fixed Domains ⋮ Harald Ganzinger’s Legacy: Contributions to Logics and Programming ⋮ TAGED Approximations for Temporal Properties Model-Checking
This page was built for publication: Tree Automata with Equality Constraints Modulo Equational Theories
