In this paper, by considering the notion of hyper hoop-algebras, we define the concepts of (strong) regular relations on hyper hoop-algebras and investigate some properties of them. Then we construct a quotient (hyper) hoop-algebra by a (strong)regular relation on hyper hoop-algebras. Finally, we define the notion of maximal filter and we investigate the relation between quotient simple hyper h...

In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called the independence relation. This algorithm is similar to the RPNI algorithm, but it is based on Asynchronous Cellular Automata. For this purpose, we define Asynchronous Cellular Moore Machines and implement the merge ...

We analyze the Einstein equations for a spherically symmetric static distribution of matter which satisfies a given constitutive relation for elastomechanics. After reducing the equations into a system of Fuchsian ODE for certain scalar invariants of the strain, we show that, for a given constitutive relation and a given value of central pressure satisfying certain compatibility conditions, the...

The regular Einstein relation, connecting the coefficient of ambipolar diffusion and the Dember field with mobilities, is generalized for the case of an interacting electron-hole plasma. The calculations are presented for a nondegenerate plasma injected by light into semiconductors of silicon and germanium type. The Debye-Huckel correlation and the Wigner-Seitz exchange terms are considered. Co...

We investigate rational relations over trees. Our starting point is the definition of rational tree relations via rational expressions by Raoult (Bull. Belg.Math. Soc. 1997). We develop a new class of automata, called asynchronous tree automata, which recognize exactly these relations. The automata theoretic approach is convenient for the solution of algorithmic problems (like the emptiness pro...

We extend our investigation of the notion that a system built of communicating processes is an acceptable implementation of another base or target system, in the case that respective specification and implementation processes have different interfaces and we combine into a single scheme implementation relations previously presented. We also relax significantly the restrictions placed upon targe...

in this article we study two different generalizations of von neumann regularity, namely strong topological regularity and weak regularity, in the banach algebra context. we show that both are hereditary properties and under certain assumptions, weak regularity implies strong topological regularity. then we consider strong topological regularity of certain concrete algebras. moreover we obtain ...

in this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.