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...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Gécseg Ferenc
Gyurica György
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
Leíró adatok
Tartalmi kivonat: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.
Terjedelem/Fizikai jellemzők:449-457
ISSN:0324-721X