the purpose of the present work is to introduce the concept of bifuzzy core of a fuzzy automaton, which induces a bifuzzy topology on the state-set of this fuzzy automaton. this is shown that this bifuzzy topology can be used to characterize the concepts such as bifuzzy family of submachines, bifuzzy separable family and bifuzzy retrievable family of a fuzzy automaton.

we consider the transitive linear maps on the operator algebra $b(x)$for a separable banach space $x$. we show if a bounded linear map is norm transitive on $b(x)$,then it must be hypercyclic with strong operator topology. also we provide a sot-transitivelinear map without being hypercyclic in the strong operator topology.

The purpose of the present work is to introduce the concept of bifuzzy core of a fuzzy automaton, which induces a bifuzzy topology on the state-set of this fuzzy automaton. This is shown that this bifuzzy topology can be used to characterize the concepts such as bifuzzy family of submachines, bifuzzy separable family and bifuzzy retrievable family of a fuzzy automaton.

in this paper, we introduce the concepts of right, left and product stabilizers on hoops and study some properties and the relation between them.  and we try to find that how they can be equal and investigate that under what condition they can be filter, implicative filter, fantastic and positive implicative filter. also, we prove that  right and product stabilizers are filters and if they are ...

We consider the transitive linear maps on the operator algebra $B(X)$for a separable Banach space $X$. We show if a bounded linear map is norm transitive on $B(X)$,then it must be hypercyclic with strong operator topology. Also we provide a SOT-transitivelinear map without being hypercyclic in the strong operator topology.

In this paper, we introduce the concepts of right, left and product stabilizers on hoops and study some properties and the relation between them.  And we try to find that how they can be equal and investigate that under what condition they can be filter, implicative filter, fantastic and positive implicative filter. Also, we prove that  right and product stabilizers are filters and if they are ...

We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines. We prove that under the Axiom of Choice non-separable normed spaces cannot even be admissibly represented with respect to any compatible topology (a compatible topology is one which makes all bounded linear function...