Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete

Details Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete

2009-11-18

arxiv.org/abs/0911.3674v1

Computer Science

Symbolic Computation

Scientific paper

Finite-state tree automata are a well studied formalism for representing term languages. This paper studies the problem of determining the regularity of the set of instances of a finite set of terms with variables, where each variable is restricted to instantiations of a regular set given by a tree automaton. The problem was recently proved decidable, but with an unknown complexity. Here, the exact complexity of the problem is determined by proving EXPTIME-completeness. The main contribution is a new, exponential time algorithm that performs various exponential transformations on the involved terms and tree automata, and decides regularity by analyzing formulas over inequality and height predicates.

Affiliated with

Also associated with

No associations

Rating

Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-452212