On regular languages determined by nondeterministic directable automata

Imreh Balázs and Ito Masami: On regular languages determined by nondeterministic directable automata. In: Acta cybernetica, (17) 1. pp. 1-10. (2005)

[thumbnail of Imreh_2005_ActaCybernetica.pdf]
Cikk, tanulmány, mű

Download (140kB) | Preview


It is known that the languages consisting of directing words of deterministic and nondeterministic automata are regular. Here these classes of regular languages are studied and compared. By introducing further three classes of regular languages, it is proved that the 8 classes considered form a semilattice with respect to intersection.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2005
Volume: 17
Number: 1
ISSN: 0324-721X
Page Range: pp. 1-10
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38519/
Uncontrolled Keywords: Számítástechnika, Kibernetika, Automaták
Additional Information: Bibliogr.: p. 9-10. ; ö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. 15. 12:20
URI: http://acta.bibl.u-szeged.hu/id/eprint/12749

Actions (login required)

View Item View Item