Ground Reducibility and Automata with Disequality Constraints
نویسندگان
چکیده
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.
منابع مشابه
Ground Reducibility is EXPTIME-Complete
We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the computations of an alternating Turing machine whose space is polynomially bounded. It is more difficult to show that ground reducibility belongs to DEXPTIME. We associate first an automaton with disequality constraints AR;t to a rewrite system R and a term t. This automaton is d...
متن کاملNormalization of Horn clauses with disequality constraints
Horn clauses constitute a convenient, Turing-powerful tool for the specification and representation of analysis problems. However, it is not possible to express disequality conditions directly and in a natural way by means of Horn clauses. This thesis therefore proposes an extension of Horn clauses with several kinds of disequality constraints. In order to provide an automatic analysis framewor...
متن کاملThe Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard
The model of tree automata with equality and disequality constraints was introduced in 2007 by Filiot, Talbot and Tison. In this paper we show that if there is at least one disequality constraint, the emptiness problem is NP-hard.
متن کاملOn Nondeterministic Unranked Tree Automata with Sibling Constraints
We continue the study of bottom-up unranked tree automata with equality and disequality constraints between direct subtrees. In particular, we show that the emptiness problem for the nondeterministic automata is decidable. In addition, we show that the universality problem, in contrast, is undecidable.
متن کاملDecidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
We define a class of ranked tree automata TABG generalizing both the tree automata with local tests between brothers of Bogaert and Tison (1992) and with global equality and disequality constraints (TAGED) of Filiot et al. (2007). TABG can test for equality and disequality modulo a given flat equational theory between brother subterms and between subterms whose positions are defined by the stat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994