Recognisable languages over monads

In this talk, I will discuss extensions of semigroups, which are defined using Eilenberg-Moore algebras over monads. The methodology is that one designs a monad around a chosen kind of object, e.g. words, trees or graphs. Once the monad has been defined, abstract nonsense is employed to automatically get notions such as “semigroup/algebra”, “term”, “equation”, “pseudovariety”, “profinite”, etc. Some of the more generic theorems also get automatically proved, e.g. the Eilenberg Pseudovariety Theorem, or the Reiterman Theorem.

This talk is based on the draft monograph

https://arxiv.org/pdf/2008.11635.pdf

Date and Venue

Start Date
Venue
Online Zoom meeting
End Date

Speaker

Mikołaj Bojańczyk

Speaker's Institution

University of Warsaw

Files

Area

Semigroups, Automata and Languages

Financiamento