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...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2005
|
| Sorozat: | Acta cybernetica
17 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Automaták |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12749 |
| LEADER | 01131nab a2200229 i 4500 | ||
|---|---|---|---|
| 001 | acta12749 | ||
| 005 | 20220615122016.0 | ||
| 008 | 161015s2005 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Imreh Balázs | |
| 245 | 1 | 3 | |a On regular languages determined by nondeterministic directable automata |h [elektronikus dokumentum] / |c Imreh Balázs |
| 260 | |c 2005 | ||
| 300 | |a 1-10 | ||
| 490 | 0 | |a Acta cybernetica |v 17 No. 1 | |
| 520 | 3 | |a 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. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika, Automaták | ||
| 700 | 0 | 1 | |a Ito Masami |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12749/1/Imreh_2005_ActaCybernetica.pdf |z Dokumentum-elérés |