109 urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891 JUCS - Journal of Universal Computer Science jucs 0948-695X 0948-6968 Journal of Universal Computer Science 10.3217/jucs-013-11-1540 28880 Research Article F.1.1 - Models of Computation F.1 - COMPUTATION BY ABSTRACT DEVICES Equivalent Transformations of Automata by Using Behavioural Automata Ciobanu Gabriel gabriel@info.uaic.ro 1 Rudeanu Sergiu 2 "A.I.Cuza" University, Iaşi, Romania "A.I.Cuza" University Iaşi Romania University of Bucharest, Bucharest, Romania University of Bucharest Bucharest Romania

Corresponding author: Gabriel Ciobanu (gabriel@info.uaic.ro).

Academic editor:

2007 28 11 2007 13 11 1540 1549 F34F1591-0816-5412-A09F-7EEB6032BED6 6999974 Gabriel Ciobanu, Sergiu Rudeanu This article is freely available under the J.UCS Open Content License.

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.