On regular languages determined by nondeterministic directable automata

Authors:
Balázs Imreh;Masami Ito
Affiliations:
Dept. of Informatics, University of Szeged, Szeged, Hungary;Dept. of Mathematics, Faculty of Science, Kyoto Sangyo University, Kyoto, Japan
Venue:
Acta Cybernetica
Year:
2005

Citing 5
Cited 0

Directable nondeterministic automata

Acta Cybernetica
Ultimate-Definite and Symmetric-Definite Events and Automata

Journal of the ACM (JACM)
Synchronizations and General Repetitive Machines, with Applications to Ultimate Definite Automata

Journal of the ACM (JACM)
Automata, Languages, and Machines

Automata, Languages, and Machines
On Some Special Classes of Regular Languages

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa

Quantified Score

Hi-index	0.00

Visualization

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.