On regular languages determined by nondeterministic directable automata
AbstractIt 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.
Download data is not yet available.
How to Cite
Imreh, B., & Ito, M. (2005). On regular languages determined by nondeterministic directable automata. Acta Cybernetica, 17(1), 1-10. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3650