Regular tree languages and quasi orders
Regular languages were characterized as sets closed with respect to monotone well-quasi orders. A similar result is proved here for tree languages. Moreover, families of quasi orders that correspond to positive varieties of tree languages and varieties of finite ordered algebras are characterized.
Elmentve itt :
| Szerző: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Cikk |
| Megjelent: |
2006
|
| Sorozat: | Acta cybernetica
17 No. 4 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12797 |
| LEADER | 01130nab a2200229 i 4500 | ||
|---|---|---|---|
| 001 | acta12797 | ||
| 005 | 20220616100344.0 | ||
| 008 | 161015s2006 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 Petković Tatjana | |
| 245 | 1 | 0 | |a Regular tree languages and quasi orders |h [elektronikus dokumentum] / |c Petković Tatjana |
| 260 | |c 2006 | ||
| 300 | |a 811-823 | ||
| 490 | 0 | |a Acta cybernetica |v 17 No. 4 | |
| 520 | 3 | |a Regular languages were characterized as sets closed with respect to monotone well-quasi orders. A similar result is proved here for tree languages. Moreover, families of quasi orders that correspond to positive varieties of tree languages and varieties of finite ordered algebras are characterized. | |
| 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 | ||
| 710 | |a International Conference on Automata and Formal Languages (11.) (2005) (Dobogókő) | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12797/1/Petkovic_2006_ActaCybernetica.pdf |z Dokumentum-elérés |