Equivalent Transformations of Automata by Using Behavioural Automata

This paper uses category theory to emphasize the relationships between mealy, moore and rabin-scott automata, and the behavioural automata are used as a unifying framework. some of the known links between mealy, moore and rabinscott automata are translated into isomorphisms of categories, and we also show how behavioural automata connect to these automata. considering the distinction between final and sequential behaviours of an automaton, we define a sequential version of mealy automata and study its relationship to behavioural automata