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

Full description

Saved in:
Bibliographic Details
Main Authors: Gécseg Ferenc
Gyurica György
Format: Article
Published: 2006
Series:Acta cybernetica 17 No. 3
Kulcsszavak:Számítástechnika, Kibernetika
Subjects:
Online Access:http://acta.bibl.u-szeged.hu/12775
Description
Summary: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.
Physical Description:449-457
ISSN:0324-721X