This paper contributes to the techniques of topo-algebraic recognition for languages beyond
the regular setting as they relate to logic on words. In particular, we provide a general …

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 …

We show that, if S is a finite semiring, then the free profinite S-semimodule on a Boolean
Stone space X is isomorphic to the algebra of all S-valued measures on X, which are finitely …

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 …

The unifying theme of the thesis is the semantic meaning of logical quantifiers. In their basic
form quantifiers allow to state theexistence, or non-existence, of individuals satisfying a …

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 …