Ground Reducibility is EXPTIME-complete - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Information and Computation Year : 2003

Ground Reducibility is EXPTIME-complete


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.
Fichier principal
Vignette du fichier
CJ-icomp.pdf (837.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00578859 , version 1 (22-03-2011)


  • 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⟩
124 View
134 Download


Gmail Facebook Twitter LinkedIn More