The Boolean closure of DR-recognizable tree languages
The family DRec of tree languages recognized by deterministic root-tofrontier (top-down) tree automata is not closed under unions or complements. Hence, it is not a variety of tree languages in the sense of Steinby. However, we show that the Boolean closure of DRec is a variety which is properly inc...
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1992
|
| Sorozat: | Acta cybernetica
10 No. 4 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12511 |
| LEADER | 01180nab a2200217 i 4500 | ||
|---|---|---|---|
| 001 | acta12511 | ||
| 005 | 20220613095335.0 | ||
| 008 | 161015s1992 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 Jurvanen Eija | |
| 245 | 1 | 4 | |a The Boolean closure of DR-recognizable tree languages |h [elektronikus dokumentum] / |c Jurvanen Eija |
| 260 | |c 1992 | ||
| 300 | |a 255-272 | ||
| 490 | 0 | |a Acta cybernetica |v 10 No. 4 | |
| 520 | 3 | |a The family DRec of tree languages recognized by deterministic root-tofrontier (top-down) tree automata is not closed under unions or complements. Hence, it is not a variety of tree languages in the sense of Steinby. However, we show that the Boolean closure of DRec is a variety which is properly included in the variety Rec of all recognizable tree languages. This Boolean closure is also compared with some other tree language varieties. | |
| 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/12511/1/cybernetica_010_numb_004_255-272.pdf |z Dokumentum-elérés |