On monotone languages and their characterization by regular expressions
In one of their papers, F. Gécseg and B. Imreh gave a characterization for monotone string languages by regular expressions. It has turned out that the monotone string languages are exactly those languages that can be represented by finite unions of seminormal chain languages. In this paper a simila...
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2007
|
| Sorozat: | Acta cybernetica
18 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12806 |
| LEADER | 01114nab a2200217 i 4500 | ||
|---|---|---|---|
| 001 | acta12806 | ||
| 005 | 20220616132338.0 | ||
| 008 | 161015s2007 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 Gyurica György | |
| 245 | 1 | 3 | |a On monotone languages and their characterization by regular expressions |h [elektronikus dokumentum] / |c Gyurica György |
| 260 | |c 2007 | ||
| 300 | |a 115-134 | ||
| 490 | 0 | |a Acta cybernetica |v 18 No. 1 | |
| 520 | 3 | |a In one of their papers, F. Gécseg and B. Imreh gave a characterization for monotone string languages by regular expressions. It has turned out that the monotone string languages are exactly those languages that can be represented by finite unions of seminormal chain languages. In this paper a similar characterization is given for monotone DR-languages. | |
| 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 | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12806/1/Gyurica_2007_ActaCybernetica.pdf |z Dokumentum-elérés |