We show that the gauge hierarchy problem can be solved in the framework of scalar-tensor theories of gravity very much in the same way as it is solved in the Randall-Sundrum scenario. Our solution involves a fine-tuning of the gravitational sector which can, however, be avoided if a supergravity extension of the dilaton sector is considered. However our mechanism does not require the introducti...

This article considers the equivalence problem of multitape automata with multidimensional tapes, where the motion of the heads is monotone in all directions (no backward motion). It is shown that this problem can be reduced to the equivalence problem of ordinary multitape automata. Some applications of the result are adduced. © 2008 Elsevier Inc. All rights reserved.

Today, the computational complexity of equivalence problems such as the graph isomorphism problem and the Boolean formula equivalence problem remain only partially understood. One of the most important tools for determining the (relative) difficulty of a computational problem is the many-one reduction, which provides a way to encode an instance of one problem into an instance of another. In equ...

We discuss three variants of the DT0L sequence equivalence problem. One of the variants generalizes the ω-sequence equivalence problem of D0L systems for DT0L systems.

the main goal of the present paper is to extend classical results from the measure theory and dynamical systems to the fuzzy subset setting. in this paper, the notion of  dynamic equivalence relation is introduced and then it is proved that this relation is an equivalence relation. also, a new metric on the collection of all equivalence classes is introduced and it is proved that this metric is...

Preface The study of Process Algebra has received a great deal of attention since the pioneering work in the 1970s of the likes of R. Milner and C.A.R. Hoare. This attention has been merited as the formalism provides a natural framework for describing and analysing systems: concurrent systems are described naturally using constructs which have intuitive interpretations, such as notions of abstr...

In this paper, we show the equivalence between matrix rational interpolation problems with poles as interpolation points and no-pole problems. This equivalence provides an effective method for computing matrix rational interpolants having poles as interpolation points. However, this equivalence is only valid in those cases where enough pole information is known. It is an open problem on how one...