We study the problem of computing the transitive closure of tree-automatic (binary) relations,
which are represented by tree automata. Such relations include classes of infinite systems …

Regular tree languages are a popular device for reachability analysis over term rewrite
systems, with many applications like analysis of cryptographic protocols, or confluence and …

Regular tree languages are a popular device for reachability analysis over term rewrite
systems, with many applications like analysis of cryptographic protocols, or confluence and …

This paper addresses the following general problem of tree regular model-checking: decide
whether where is the reflexive and transitive closure of a successor relation induced by a …

We provide a generic work-list algorithm to compute the transitive closure of finite relations
where only successors of newly detected states are generated. This algorithm is then …

We consider the problem of recurrent reachability over infinite systems given by regular
relations on words and trees, ie, whether a given regular set of states can be reached …

In a recent paper we introduced a new framework for the study of call by need computations
to normal form and root-stable form in term rewriting. Using elementary tree automata …

Establishing termination of programs and processes is one of the most fundamental
problems in computer science. In the area of term rewriting, a Turingcomplete model of …

This paper investigates the use of tree automata with global equalities and disequalities
(TAGED for short) in reachability analysis over term rewriting systems (TRSs). The …

In the paper, we introduce a new tree automata framework, called propositional tree
automata, capturing the class of tree languages that are closed under an equational theory …