On regular languages determined by nondeterministic directable automata[*]

 Balázs Imreh - Masami Ito

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.

Footnotes

 This work has been supported by the Japanese Ministry of Education, Mombusho International Scientific Research Program, Joint Research 10044098 and the Hungarian National Foundation for Scientific Research, Grant T037258.

 Dept. of Informatics, University, of Szeged, Árpád tér 2, H-6720 Szeged, Hungary

 Dept. of Mathematics, Faculty of Science, Kyoto Sangyo University, Kyoto 603-8555, Japan