Where academic tradition
meets the exciting future

Varieties of Tree Languages Definable by Syntactic Monoids

Saeed Salehi, Varieties of Tree Languages Definable by Syntactic Monoids. TUCS Technical Reports 619, Turku Centre for Computer Science, 2004.

Abstract:

An algebraic characterization of the families of tree languages definable by syntactic monoids is presented. This settles a question raised by several authors.

Files:

Full publication in PDF-format

BibTeX entry:

@TECHREPORT{tSalehi04b,
  title = {Varieties of Tree Languages Definable by Syntactic Monoids},
  author = {Salehi, Saeed},
  number = {619},
  series = {TUCS Technical Reports},
  publisher = {Turku Centre for Computer Science},
  year = {2004},
  keywords = {Tree languages, Tree automata, Varieties of tree languages, Varieties of finite algebras, Syntactic monoids},
  ISBN = {952-12-1394-9},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Edit publication