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 2023Show all

1 paper · 1 filter

cs.LO2023

Folding interpretations

Mikołaj Bojańczyk

We study the polyregular string-to-string functions, which are certain functions of polynomial output size that can be described using automata and logic. We describe a system of c…