Gécseg Ferenc and Gyurica György: On the closedness of nilpotent DR tree languages under Boolean operations. In: Acta cybernetica, (17) 3. pp. 449-457. (2006)
Preview |
Cikk, tanulmány, mű
Gecseg_2006_ActaCybernetica.pdf Download (109kB) | Preview |
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.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 2006 |
| Volume: | 17 |
| Number: | 3 |
| ISSN: | 0324-721X |
| Page Range: | pp. 449-457 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/38521/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika |
| Additional Information: | Bibliogr.: p. 456-457. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:25 |
| Last Modified: | 2022. Jun. 15. 13:54 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12775 |
Actions (login required)
 |
View Item |
