Ground Reducibility is EXPTIME-complete

Hubert Comon-Lundh 1 Florent Jacquemard 2
2 DAHU - Verification in databases
CNRS - Centre National de la Recherche Scientifique : UMR8643, Inria Saclay - Ile de France, ENS Cachan - École normale supérieure - Cachan, LSV - Laboratoire Spécification et Vérification [Cachan]
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 metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/inria-00578859
Contributor : Florent Jacquemard <>
Submitted on : Tuesday, March 22, 2011 - 3:06:57 PM
Last modification on : Thursday, February 7, 2019 - 5:29:22 PM
Long-term archiving on : Thursday, June 23, 2011 - 2:47:07 AM

File

CJ-icomp.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00578859, version 1

Collections

Citation

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

Share

Metrics

Record views

320

Files downloads

203