Showing 2024Show all
3 papers · 1 filter
cs.FL2024
Monads, Comonads, and Transducers
Rafał Stefański
This paper proposes a definition of recognizable transducers over monads and comonads, which bridges two important ongoing efforts in the current research on regularity. The first…
cs.FL2024
The single-use restriction for register automata and transducers over infinite alphabets
Rafał Stefański
This thesis studies the single-use restriction for register automata and transducers over infinite alphabets. The restriction requires that a read-access to a register should have…
cs.LO2024
Function spaces for orbit-finite sets
Mikołaj Bojańczyk, Lê Thành Dũng Nguyên, Rafał Stefański
Orbit-finite sets are a generalisation of finite sets, and as such support many operations allowed for finite sets, such as pairing, quotienting, or taking subsets. However, they d…