Papers
Topics
Authors
Recent
Search
2000 character limit reached

Eilenberg theorems for many-sorted formations

Published 16 Apr 2016 in cs.FL | (1604.04792v1)

Abstract: A theorem of Eilenberg establishes that there exists a bijection between the set of all varieties of regular languages and the set of all varieties of finite monoids. In this article after defining, for a fixed set of sorts $S$ and a fixed $S$-sorted signature $\Sigma$, the concepts of formation of congruences with respect to $\Sigma$ and of formation of $\Sigma$-algebras, we prove that the algebraic lattices of all $\Sigma$-congruence formations and of all $\Sigma$-algebra formations are isomorphic, which is an Eilenberg's type theorem. Moreover, under a suitable condition on the free $\Sigma$-algebras and after defining the concepts of formation of congruences of finite index with respect to $\Sigma$, of formation of finite $\Sigma$-algebras, and of formation of regular languages with respect to $\Sigma$, we prove that the algebraic lattices of all $\Sigma$-finite index congruence formations, of all $\Sigma$-finite algebra formations, and of all $\Sigma$-regular language formations are isomorphic, which is also an Eilenberg's type theorem.

Citations (2)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.