We mapped the elements that mediate termination of transcription downstream of the chicken betaH- and betaA-globin gene poly(A) sites. We found no unique element and no segment of 3'-flanking DNA to be significantly more effective than any other. When we replaced the native 3'-flanking DNA with bacterial DNA, it too supported transcription termination. Termination in the bacterial DNA depended ...

Two techniques are examined for showing termination of rewrite systems when simpli cation ordering are insu cient. The rst approach generalizes the various path orderings and the conditions under which they work. Examples of its use are given and a brief description of an implementation is presented. The second approach uses restricted derivations, called \forward closures", for proving termina...

The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems (TRSs). We present two important extensions of this technique: First, we show how to prove termination of higher-order functions using dependency pairs. To this end, the dependency pair technique is extended to handle (untyped) applicative TRSs. Second, we introduce a method to pr...

We investigate termination of rewriting computations guided by strategy annotations. We show that proofs of termination can be obtained by proving (innermost) termination of context-sensitive rewriting (CSR). Hence, we investigate how to prove innermost termination of CSR using existing methods for proving termination of CSR.

We introduce a technique to facilitate termination proofs for term rewriting systems. We especially focus on innermost termination. The main features of this technique lie in its simplicity and e ectiveness in practice. This work can be regarded as an application of the general notion termination through transformation to both termination and innermost termination proofs.

Regulators in Australia, Japan, United Kingdom and many countries in Europe have regulated mobile termination rates reflecting concerns about the high level of these charges and the resulting high fixed-to-mobile retail prices. In Latin American countries, despite success in expanding mobile telephony, the relatively high charges imposed by mobile phone operators on fixed line networks to accep...

We present decidability results for termination of classes of term rewriting systems modulo permutative theories. Termination and innermost termination modulo permutative theories are shown to be decidable for term rewrite systems (TRS) whose right-hand side terms are restricted to be shallow (variables occur at depth at most one) and linear (each variable occurs at most once). Innermost termin...

We consider the problem of proving termination of ordersorted rewrite systems. The dominating method for proving termination of order-sorted systems has been to simply ignore sort information, and use the techniques developed for unsorted rewriting. The problem with this approach is that many order-sorted rewrite systems terminate because of the structure of the set of sorts. In these cases the...

Recently, SAT solving has become the backbone for tackling the search problems in automated termination analysis for term rewrite systems and for programming languages. Indeed, even since the last SAT competition in 2007, many new termination techniques have been published where automation heavily relies on the efficiency of modern SAT solvers. Here, a successful satisfiability proof of the SAT...