| Institute of Informatics>>> Acta Cybernetica>>> Past Issues>>> Volume 17, Number 3, 2006>>> |
 Magyarul
|
On the closedness of nilpotent DR tree languages under Boolean operations
Ferenc Gécseg and György Gyurica
Abstract (in LaTeX format)
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.
Full text
Available electronic editions: PDF.
Note that full text is available only for papers that are at least 3 years old. For more recent papers only the first page of the paper is provided.
BibTeX entry
@article{Gecseg:2006:ActaCybernetica,author = {Ferenc G\'ecseg and Gy{\"o}rgy Gyurica},
title = {On the closedness of nilpotent DR tree languages under Boolean operations},
journal = {Acta Cybernetica},
year = {2006},
volume = {17},
number = {3},
pages = {449--457},
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.}
}