Computability

Automatic Synthesis of Systems with Data

We partly lift synthesis to infinite domains through register automata, targeting register transducers or computable implementations.

On Computability of Data Word Functions Defined by Transducers @ ETAPS 2021

We extend the correspondence between computability and continuity over regular functions to the case of data words.

Computability of Data-Word Transductions over Different Data Domains (submitted to the LMCS Special Issue dedicated to FoSSaCS 2020)

We extend the correspondence between computability and continuity over regular functions to the case of data words.

On Computability of Data Word Functions Defined by Transducers @ HIGHLIGHTS 2020

We extend the correspondence between computability and continuity over regular functions to the case of data words.

On Computability of Data Word Functions Defined by Transducers @ MOVEP 2020

We extend the correspondence between computability and continuity over regular functions to the case of data words.

On Computability of Data Word Functions Defined by Transducers (FoSSaCS 2020)

We extend the correspondence between computability and continuity over regular functions to the case of data words.

On Computability of Data Word Functions Defined by Transducers

We extend the correspondence between computability and continuity over regular functions to the case of data words.