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. Acta Cybernetica 17(1), 21 – 41, 2005.

Abstract:

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

BibTeX entry:

@ARTICLE{jSalehi05a,
  title = {Varieties of Tree Languages Definable by Syntactic Monoids},
  author = {Salehi, Saeed},
  journal = {Acta Cybernetica},
  volume = {17},
  number = {1},
  publisher = {Institute of Informatics, University of Szeged, Szeged, Hungary},
  pages = {21 – 41},
  year = {2005},
}

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

Publication Forum rating of this publication: level 1

Edit publication