We consider the space of weakly almost periodic functions on a transformation semigroup (S, X , ?) and show that if X is a locally compact noncompact uniform space, and ? is a separately continuous, separately proper, and equicontinuous action of S on X, then every continuous function on X, vanishing at infinity is weakly almost periodic. We also use a number of diverse examples to show ...

in this paper, we define the concepts of a complex fuzzy subset and a complex fuzzy finite state automaton. then we extend the notion of a complex fuzzy finite state automaton and introduce the notion of a general complex fuzzy automaton. after that we define the concept of a max- min general complex fuzzy automaton and construct some equivalence relations and some congruence relations in a max...

we extend the notion of semigroup compactification to the class of transformation semigroups, and determine the compactifications which are universal with respect to some topological properties.

We extend the notion of semigroup compactification to the class of transformation semigroups, and determine the compactifications which are universal with respect to some topological properties.

we consider the space of weakly almost periodic functions on a transformation semigroup (s, x , ?) and show that if x is a locally compact noncompact uniform space, and ? is a separately continuous, separately proper, and equicontinuous action of s on x, then every continuous function on x, vanishing at infinity is weakly almost periodic. we also use a number of diverse examples to show that th...

In the transformation semigroup (X, S) we introduce the height of a closed nonempty invariant subset of X, define the transformed dimension of nonempty subset S of X and obtain some results and relations.

If in a transformation semigroup we assume that the set being acted upon has a semigroup structure, then the transformation semigroup can be used to recognize languages of unranked trees. This observation allows us to examine the relationship connecting languages of unranked trees with standard algebraic concepts such as aperiodicity, idempotency, commutativity and wreath product. In particular...

This is a survey paper on algorithms that have been developed during the last 25 years for the explicit computation of the structure of an associative algebra of finite dimension over either a finite field or an algebraic number field. This constructive approach was initiated in 1985 by Friedl and Rónyai and has since been developed by Cohen, de Graaf, Eberly, Giesbrecht, Ivanyos, Küronya and W...