On commutative asynchronous nondeterministic automata

In this paper, we deal with nondeterministic automata, in particular, commutative asynchronous ones. Our goal is to give their isomorphic representation under the serial product or equivalently, under the α0-product. It turns out that this class does not contain any finite isomorphically complete sy...

Full description

Saved in:
Bibliographic Details
Main Authors: Imreh Balázs
Ito Masami
Pukler Antal
Format: Article
Published: 2000
Series:Acta cybernetica 14 No. 4
Kulcsszavak:Számítástechnika, Kibernetika, Automaták
Subjects:
Online Access:http://acta.bibl.u-szeged.hu/12653
LEADER 01313nab a2200241 i 4500
001 acta12653
005 20220614111340.0
008 161015s2000 hu o 0|| eng d
022 |a 0324-721X 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Imreh Balázs 
245 1 3 |a On commutative asynchronous nondeterministic automata  |h [elektronikus dokumentum] /  |c  Imreh Balázs 
260 |c 2000 
300 |a 607-617 
490 0 |a Acta cybernetica  |v 14 No. 4 
520 3 |a In this paper, we deal with nondeterministic automata, in particular, commutative asynchronous ones. Our goal is to give their isomorphic representation under the serial product or equivalently, under the α0-product. It turns out that this class does not contain any finite isomorphically complete system with respect to the α0-product. On the other hand, we present an isomorphically complete system for this class which consists of one monotone nondeterministic automaton of three elements. 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Számítástechnika, Kibernetika, Automaták 
700 0 1 |a Ito Masami  |e aut 
700 0 1 |a Pukler Antal  |e aut 
856 4 0 |u http://acta.bibl.u-szeged.hu/12653/1/cybernetica_014_numb_004_607-617.pdf  |z Dokumentum-elérés