activity
20182026
most citedLanguages recognised by finite semigroups, and their generalisations to objects such as trees and graphs, with an emphasis on definability in monadic second-order logic

3 citations · 10 across the 8 of their papers we have counts for

collaborators
Showing 2020Show all

3 papers · 1 filter

cs.FL2020★ 3 cited

Languages recognised by finite semigroups, and their generalisations to objects such as trees and graphs, with an emphasis on definability in monadic second-order logic

Mikołaj Bojańczyk

These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the a…

cs.FL2020

Extensions of -Regular Languages

Mikołaj Bojańczyk, Edon Kelmendi, Rafał Stefański +1

We consider extensions of monadic second order logic over -words, which are obtained by adding one language that is not -regular. We show that if the added language has a…

cs.FL2020

First-order tree-to-tree functions

Mikołaj Bojańczyk, Amina Doumane

We study tree-to-tree transformations that can be defined in first-order logic or monadic second-order logic. We prove a decomposition theorem, which shows that every transformatio…