| Informatikai Tanszékcsoport>>> Oktatás>>> | In English |
On the closedness of nilpotent DR tree languages under Boolean operations
F. Gécseg - Gy. Gyurica
To Professor László Leindler on his 70th birthdayAbstract:
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.
Footnotes
... operations This work has been supported by the Hungarian National Foundation for Scientific Research, Grant T 048786.
... Gyurica Department of Informatics, University of Szeged, Árpád tér 2, H-6720 Szeged, Hungary.