On regular languages determined by nondeterministic directable automata
B Imreh, M Ito - Acta Cybernetica, 2005 - cyber.bibl.u-szeged.hu
B Imreh, M Ito
Acta Cybernetica, 2005•cyber.bibl.u-szeged.huIt 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.
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.
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.
cyber.bibl.u-szeged.hu