On the closedness of nilpotent DR tree languages under Boolean operations

  • Ferenc Gécseg
  • György Gyurica

Abstract

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.

Downloads

Download data is not yet available.
Published
2006-01-01
How to Cite
Gécseg, F., & Gyurica, G. (2006). On the closedness of nilpotent DR tree languages under Boolean operations. Acta Cybernetica, 17(3), 449-457. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3676
Section
Regular articles