Automata for reduction properties solving
From MaRDI portal
Publication:1911400
DOI10.1006/jsco.1995.1048zbMath0843.68071OpenAlexW2078381694MaRDI QIDQ1911400
Jean-Luc Coquidé, Max Dauchet, Anne-Cecile Caron
Publication date: 6 June 1996
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1995.1048
Related Items (15)
Ground reducibility is EXPTIME-complete ⋮ Test sets for the universal and existential closure of regular tree languages. ⋮ Tree automata with equality constraints modulo equational theories ⋮ Sufficient completeness verification for conditional and constrained TRS ⋮ Tree Automata with Global Constraints ⋮ Tree automata for rewrite strategies ⋮ E-generalization using grammars ⋮ TREE AUTOMATA WITH GLOBAL CONSTRAINTS ⋮ Rigid tree automata and applications ⋮ Rigid Tree Automata ⋮ The HOM Problem is EXPTIME-Complete ⋮ TAGED Approximations for Temporal Properties Model-Checking ⋮ The undecidability of the first-order theories of one step rewriting in linear canonical systems ⋮ Non-linear rewrite closure and weak normalization ⋮ Emptiness and finiteness for tree automata with global reflexive disequality constraints
This page was built for publication: Automata for reduction properties solving
