Regular tree languages and quasi orders

Petković Tatjana: Regular tree languages and quasi orders. In: Acta cybernetica, (17) 4. pp. 811-823. (2006)

[thumbnail of Petkovic_2006_ActaCybernetica.pdf]
Cikk, tanulmány, mű

Download (174kB) | Preview


Regular languages were characterized as sets closed with respect to monotone well-quasi orders. A similar result is proved here for tree languages. Moreover, families of quasi orders that correspond to positive varieties of tree languages and varieties of finite ordered algebras are characterized.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2006
Volume: 17
Number: 4
ISSN: 0324-721X
Page Range: pp. 811-823
Language: English
Place of Publication: Szeged
Event Title: International Conference on Automata and Formal Languages (11.) (2005) (Dobogókő)
Related URLs:
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: 823. p. ; ö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. 16. 10:03

Actions (login required)

View Item View Item