47 citations · 159 across the 27 of their papers we have counts for
5 papers · 1 filter
Polyregular Functions
Mikołaj Bojańczyk
This paper is about certain string-to-string functions, called the polyregular functions. These are like the regular string-to-string functions, except that they can have polynomia…
Regular tree languages in low levels of the Wadge Hierarchy
Mikołaj Bojańczyk, Filippo Cavallari, Thomas Place +1
In this article we provide effective characterisations of regular languages of infinite trees that belong to the low levels of the Wadge hierarchy. More precisely we prove decidabi…
Two monads for graphs
Mikolaj Bojanczyk
An introduction to algebras for graphs, based on Courcelle's algebras of hyperedge replacement and vertex replacement. The paper uses monad notation.
Regular and First Order List Functions
Mikolaj Bojanczyk, Laure Daviaud, Krishna Shankara Narayanan
We define two classes of functions, called regular (respectively, first-order) list functions, which manipulate objects such as lists, lists of lists, pairs of lists, lists of pair…
Definable decompositions for graphs of bounded linear cliquewidth
Mikołaj Bojańczyk, Martin Grohe, Michał Pilipczuk
We prove that for every positive integer k, there exists an MSO_1-transduction that given a graph of linear cliquewidth at most k outputs, nondeterministically, some cliquewidth de…