On the closedness of nilpotent DR tree languages under Boolean operations
This note deals with the closedness of nilpotent deterministic root-to-frontier tree languages with respect to the Boolean operations union, intersection and complementation. Necessary and sufficient conditions are given under which the union of two deterministic tree languages is also deterministic...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2006
|
| Sorozat: | Acta cybernetica
17 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12775 |
| LEADER | 01274nab a2200229 i 4500 | ||
|---|---|---|---|
| 001 | acta12775 | ||
| 005 | 20220615135427.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 Gécseg Ferenc | |
| 245 | 1 | 3 | |a On the closedness of nilpotent DR tree languages under Boolean operations |h [elektronikus dokumentum] / |c Gécseg Ferenc |
| 260 | |c 2006 | ||
| 300 | |a 449-457 | ||
| 490 | 0 | |a Acta cybernetica |v 17 No. 3 | |
| 520 | 3 | |a This note deals with the closedness of nilpotent deterministic root-to-frontier tree languages with respect to the Boolean operations union, intersection and complementation. Necessary and sufficient conditions are given under which the union of two deterministic tree languages is also deterministic. The paper ends with a characterization of the largest subclass of the class of nilpotent deterministic root-to-frontier tree languages closed under the formation of complements. | |
| 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 | ||
| 700 | 0 | 1 | |a Gyurica György |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12775/1/Gecseg_2006_ActaCybernetica.pdf |z Dokumentum-elérés |