Regular tree languages and quasi orders

  • Tatjana Petković

Abstract

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.

Downloads

Download data is not yet available.
Published
2006-01-01
How to Cite
Petković, T. (2006). Regular tree languages and quasi orders. Acta Cybernetica, 17(4), 811-823. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3698
Section
Regular articles

Most read articles by the same author(s)