Regular tree languages and quasi orders

Authors:
Tatjana Petković
Affiliations:
Nokia, Joensuunkatu, Salo, Finland
Venue:
Acta Cybernetica
Year:
2006

Citing 6
Cited 0

General varieties of tree languages

Theoretical Computer Science
Automata, Languages, and Machines

Automata, Languages, and Machines
Varieties Of Formal Languages

Varieties Of Formal Languages
On monotone automata and monotone languages

Journal of Automata, Languages and Combinatorics
Algebraic recognizability of regular tree languages

Theoretical Computer Science - The art of theory
Positive varieties of tree languages

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.