On the Transformation Semigroups of Finite Automata

on residually finite semigroups of cellullar automata

we prove that if $m$ is a monoid and $a$ a finite set with more than one element‎, ‎then the residual finiteness of $m$ is equivalent to that of the monoid consisting of all cellular automata over $m$ with alphabet $a$‎.

general complex fuzzy transformation semigroups in automata

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...

compactifications and representations of transformation semigroups

this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...

On Residually Finite Semigroups of Cellullar Automata

We prove that if M is a monoid and A a finite set with more than one element, then the residual finiteness of M is equivalent to that of the monoid consisting of all cellular automata over M with alphabet A.

The Ranks of Some Transformation Semigroups on a Finite Set