On regular languages determined by nondeterministic directable automata
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 semi...
Saved in:
| Main Authors: | |
|---|---|
| Format: | Article |
| Published: |
2005
|
| Series: | Acta cybernetica
17 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Automaták |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12749 |
| Summary: | 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. |
|---|---|
| Physical Description: | 1-10 |
| ISSN: | 0324-721X |