TY - JOUR AU - Ferenc Gécseg AU - György Gyurica PY - 2006/01/01 Y2 - 2024/03/28 TI - On the closedness of nilpotent DR tree languages under Boolean operations JF - Acta Cybernetica JA - Acta Cybern VL - 17 IS - 3 SE - Regular articles DO - UR - https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3676 AB - 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 theclass of nilpotent deterministic root-to-frontier tree languages closed under the formation of complements. ER -