On regular languages determined by nondeterministic directable automata

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

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

Download (140kB)

Abstract

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
Page Range: pp. 1-10
ISSN: 0324-721X
Language: angol
Uncontrolled Keywords: Természettudomány
Additional Information: Bibliogr.: p. 9-10.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Jun. 05. 13:41
URI: http://acta.bibl.u-szeged.hu/id/eprint/12749

Actions (login required)

View Item View Item