• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Varieties of Many-Sorted Recognizable Sets

Saeed Salehi, Magnus Steinby, Varieties of Many-Sorted Recognizable Sets. TUCS Technical Reports 626, Turku Centre for Computer Science, 2004.

Abstract:

We consider varieties of recognizable subsets of
many-sorted finitely generated free algebras over a given variety,
varieties of congruences of such algebras, and varieties of finite
many-sorted algebras. A variety theorem that establishes bijections
between the classes of these three types of varieties is proved. For
this, appropriate notions of many-sorted syntactic congruences and
algebras are needed. Also an alternative type of varieties is
considered where each subset consists of elements of just one sort.

Files:

Full publication in PDF-format

BibTeX entry:

@TECHREPORT{tSaSt04a,
  title = {Varieties of Many-Sorted Recognizable Sets},
  author = {Salehi, Saeed and Steinby, Magnus},
  number = {626},
  series = {TUCS Technical Reports},
  publisher = {Turku Centre for Computer Science},
  year = {2004},
  keywords = {Recognizable Sets, Variety Theorem, Many-sorted Algebras, Syntactic Algebras, Varieties of Finite Algebras, Tree Languages },
  ISBN = {952-12-1425-2},
}

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

Edit publication