Skip to Main content Skip to Navigation
New interface
Journal articles

Ground Reducibility is EXPTIME-complete

Hubert Comon-Lundh 1 Florent Jacquemard 2 
2 DAHU - Verification in databases
LSV - Laboratoire Spécification et Vérification [Cachan], Inria Saclay - Ile de France
Abstract : We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizable tree languages. It is more difficult to show that ground reducibility belongs to DEXPTIME. We associate first an automaton with disequality constraints A(R,t) to a rewrite system R and a term t. This automaton is deterministic and accepts at least one term iff t is not ground reducible by R. The number of states of A(R,t) is O(2^|R|x|t|) and the size of its constraints is polynomial in the size of R, t. Then we prove some new pumping lemmas, using a total ordering on the computations of the automaton. Thanks to these lemmas, we can show that emptiness for an automaton with disequality constraints can be decided in a time which is polynomial in the number of states and exponential in the size of the constraints. Altogether, we get a simply exponential time deterministic algorithm for ground reducibility decision.
Document type :
Journal articles
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Florent Jacquemard Connect in order to contact the contributor
Submitted on : Tuesday, March 22, 2011 - 3:06:57 PM
Last modification on : Saturday, June 25, 2022 - 7:39:47 PM
Long-term archiving on: : Thursday, June 23, 2011 - 2:47:07 AM


Files produced by the author(s)


  • HAL Id : inria-00578859, version 1


Hubert Comon-Lundh, Florent Jacquemard. Ground Reducibility is EXPTIME-complete. Information and Computation, 2003, 187 (1), pp.123-153. ⟨inria-00578859⟩



Record views


Files downloads