English
Related papers

Related papers: Profinite Monads, Profinite Equations, and Reiterm…

200 papers

Profinite equations are an indispensable tool for the algebraic classification of formal languages. Reiterman's theorem states that they precisely specify pseudovarieties, i.e.~classes of finite algebras closed under finite products,…

Category Theory · Mathematics 2021-06-01 Jiri Adamek , Liang-Ting Chen , Stefan Milius , Henning Urbat

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 pushdown languages and classes of finite algebras.…

Formal Languages and Automata Theory · Computer Science 2018-10-31 Silke Czarnetzki , Andreas Krebs , Klaus-Jörn Lange

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 category D and we study (pseudo)varieties of T-algebras.…

Formal Languages and Automata Theory · Computer Science 2017-02-10 Julian Salamanca

The starting point of algebraic language theory is that regular languages of finite words are exactly those recognized by finite monoids. This finiteness condition gives rise to a topological space whose points, called profinite words,…

Logic in Computer Science · Computer Science 2026-02-10 Vincent Moreau

In a previous paper, we showed that profinite $L$-algebras (where $L$ is a variety of modal algebras generated by its finite members) are monadic over $\mathbf{Set}$. This monadicity result suggests that profinite $L$-algebras could be…

Logic · Mathematics 2025-11-21 Matteo De Berardinis , Silvio Ghilardi

We prove a characterization of profinite algebras, i.e., topological algebras that are isomorphic to a projective limit of finite discrete algebras. In general profiniteness concerns both the topological and algebraic characteristics of a…

Logic · Mathematics 2020-08-25 Friedrich Martin Schneider , Jens Zumbrägel

We propose a novel topological perspective on data languages recognizable by orbit-finite nominal monoids. For this purpose, we introduce pro-orbit-finite nominal topological spaces. Assuming globally bounded support sizes, they coincide…

Computation and Language · Computer Science 2024-01-17 Fabian Birkmann , Stefan Milius , Henning Urbat

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 additive maps from the Boolean algebra of clopens of X…

Rings and Algebras · Mathematics 2020-11-19 Luca Reggio

Profinite algebras are the residually finite compact algebras; their underlying topological spaces are Stone spaces. We extend the theory of profinite algebras to a more general setting of Stone topological algebras. We introduce Stone…

Logic · Mathematics 2024-09-25 Jorge Almeida , Ondřej Klíma

For finitary regular monads T on locally finitely presentable categories we characterize the finitely presentable objects in the category of T-algebras in the style known from general algebra: they are precisely the algebras presentable by…

Category Theory · Mathematics 2019-09-06 Jiří Adámek , Stefan Milius , Lurdes Sousa , Thorsten Wißmann

Profinite algebras are exactly those that are isomorphic to inverse limits of finite algebras. Such algebras are naturally equipped with Boolean topologies. A variety $\mathcal V$ is standard if every Boolean topological algebra with the…

Logic · Mathematics 2019-02-20 Anvar M. Nurakunov , Michał M. Stronkowski

Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also appear naturally through dualization of…

Group Theory · Mathematics 2018-04-24 Jorge Almeida , Alfredo Costa

We explore new interactions between finite model theory and classical streams of universal algebra and semigroup theory. A key result is an example of finite algebras whose variety is not finitely axiomatisable in first order logic, but…

Logic · Mathematics 2026-02-12 Lucy Ham , Marcel Jackson

Monads are of interest both in semantics and in higher dimensional algebra. It turns out that the idea behind usual notion finitary monads (whose values on all sets can be computed from their values on finite sets) extends to a more general…

Category Theory · Mathematics 2012-01-18 Charles Grellois

Taking inspiration from the monadicity of complete atomic Boolean algebras, we prove that profinite modal algebras are monadic over Set. While analyzing the monadic functor, we recover the universal model construction - a construction…

Logic · Mathematics 2025-07-09 Matteo De Berardinis , Silvio Ghilardi

An algebraic theory, sometimes called an equational theory, is a theory defined by finitary operations and equations, such as the theories of groups and of rings. It is well known that algebraic theories are equivalent to finitary monads on…

Category Theory · Mathematics 2025-04-18 Yuto Kawase

Eilenberg's variety theorem, a centerpiece of algebraic automata theory, establishes a bijective correspondence between varieties of languages and pseudovarieties of monoids. In the present paper this result is generalized to an abstract…

Formal Languages and Automata Theory · Computer Science 2015-01-22 Jiri Adamek , Stefan Milius , Robert Myers , Henning Urbat

Profinite congruences on profinite algebras determining profinite quotients are difficult to describe. In particular, no constructive description is known of the least profinite congruence containing a given binary relation on the algebra.…

Group Theory · Mathematics 2020-03-09 J. Almeida , O. Klíma

Let $R$ be an algebra over a ring $\Bbbk$, $T$ an $R$-algebra, $M$ a finitely generated projective $R$-module, and $N$ a $T$-module. Let $G$ be a linearly reductive group scheme over $\Bbbk$ equipped with a representation…

We develop an algebraic language theory based on the notion of an Eilenberg--Moore algebra. In comparison to previous such frameworks the main contribution is the support for algebras with infinitely many sorts and the connection to logic…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Achim Blumensath
‹ Prev 1 2 3 10 Next ›