JUCS - Journal of Universal Computer Science 13(11): 1540-1549, doi: 10.3217/jucs-013-11-1540
Equivalent Transformations of Automata by Using Behavioural Automata
expand article infoGabriel Ciobanu‡, Sergiu Rudeanu§
‡ "A.I.Cuza" University, Iaşi, Romania§ University of Bucharest, Bucharest, Romania

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

© Gabriel Ciobanu, Sergiu Rudeanu.
This article is freely available under the J.UCS Open Content License.
Citation: Ciobanu G, Rudeanu S (2007) Equivalent Transformations of Automata by Using Behavioural Automata. JUCS - Journal of Universal Computer Science 13(11): 1540-1549. https://doi.org/10.3217/jucs-013-11-1540
Open Access
Abstract
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.
Keywords
Mealy, Moore and Rabin-Scott automata, semiautomata, behavioural automata, final and sequential behaviours of automata, category theory