Ground Reducibility and Automata with Disequality Constraints

@inproceedings{ComonLundh1994GroundRA,
  title={Ground Reducibility and Automata with Disequality Constraints},
  author={Hubert Comon-Lundh and Florent Jacquemard},
  booktitle={STACS},
  year={1994}
}
Using the automata with constraints, we give an algorithm for the decision of ground reducibility of a term t w.r.t. a rewriting system R. The complexity of the algorithm is doubly exponential in the maximum of the depths of t and R and the cardinal of R. 
Highly Cited
This paper has 26 citations. REVIEW CITATIONS