Pebble games are a powerful tool in the study of finite model theory, constraint satisfaction
and database theory. Monads and comonads are basic notions of category theory which are …

Eilenberg-type correspondences, relating varieties of languages (eg of finite words, infinite
words, or trees) to pseudovarieties of finite algebras, form the backbone of algebraic …

Whither semantics? - ScienceDirect Skip to main contentSkip to article Elsevier logo
Journals & Books Search RegisterSign in View PDF Download full issue Search …

The purpose of the present paper is to show that: Eilenberg-type correspondences=
Birkhoff's theorem for (finite) algebras+ duality. We consider algebras for a monad T on a …

We build a notion of algebraic recognition for visibly pushdown languages by finite algebraic
objects. These come with a typical Eilenberg relationship, now between classes of visibly …

In the regular languages, both the topological and algebraic approach have proven to be
very fruitful. This thesis extends both approaches to work for non-regular languages, focused …

An Eilenberg–like Theorem for Algebras on a Monad Page 1 An Eilenberg–like Theorem for
Algebras on a Monad Julian Salamanca (CWI Amsterdam) April 2, 2016 CMCS 2016 Short …

A connection between recognisable languages and profinite identities is established
through the composition of two famous theorems: Eilenberg's theorem and Reiterman's …

The notion of an equation is one of the basic concepts that allows us to classify algebraic
structures, also called algebras, which are nonempty sets with finitary operations (finitary …

Theories of regular languages and finite automata have strong connections with algebraic
theories such as the theory of finite monoid: results such as” regular languages of finite …