Right group-type automata

In this paper we deal with state-independent automata whose characteristic semigroups are right groups (left cancellative and right simple). These automata axe called right group-type automata. We prove that an A-finite automaton is state-independent if and only if it is right group-type. We define...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Babcsányi István
Nagy Attila
Dokumentumtípus: Cikk
Megjelent: 1995
Sorozat:Acta cybernetica 12 No. 2
Kulcsszavak:Számítástechnika, Kibernetika, Automaták
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/12550
Leíró adatok
Tartalmi kivonat:In this paper we deal with state-independent automata whose characteristic semigroups are right groups (left cancellative and right simple). These automata axe called right group-type automata. We prove that an A-finite automaton is state-independent if and only if it is right group-type. We define the notion of the right zero decomposition of quasi-automata and show that the state-independent automaton A is right group-type if and only if the quasi-automaton A*s corresponding to A is a right zero decomposition of pairwise isomorphic group-type quasi-automata. We also prove that the state-independent automaton A is right group-type if and only if the quasiautomaton A j corresponding to A is a direct sum of pairwise isomorphic strongly connected right group-type quasi-automata. We prove that if A is an A-finite state-independent automaton, then |S(A)| is a divisor of |AS(.i4)|. Finally, we show that the quasi-automaton A's corresponding to an A-finite state-independent automaton A is a right zero decomposition of pairwise isomorphic quasi-perfect quasi-automata if and only if |.AS(yl)| = |S(A)|.
Terjedelem/Fizikai jellemzők:131-136
ISSN:0324-721X