On commutative asynchronous nondeterministic automata

Imreh Balázs and Ito Masami and Pukler Antal: On commutative asynchronous nondeterministic automata. In: Acta cybernetica, (14) 4. pp. 607-617. (2000)

[thumbnail of cybernetica_014_numb_004_607-617.pdf]
Preview
Cikk, tanulmány, mű
cybernetica_014_numb_004_607-617.pdf

Download (713kB) | Preview

Abstract

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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2000
Volume: 14
Number: 4
ISSN: 0324-721X
Page Range: pp. 607-617
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38510/
Uncontrolled Keywords: Számítástechnika, Kibernetika, Automaták
Additional Information: Bibliogr.: 617. p. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 14. 11:13
URI: http://acta.bibl.u-szeged.hu/id/eprint/12653

Actions (login required)

View Item View Item