On Computability of Data Word Functions Defined by Transducers

The work of Vrunda Dave, Emmanuel Filiot, Krishna S and Nathan Lhote, which settles the finite alphabet case and inspired us this research direction, has been accepted at CONCUR 2020 as Synthesis of Computable Regular Functions of Infinite Words. For the present paper, we referred to the arXiv version.

Due to the worldwide outbreak of CoViD-19, ETAPS 2020 has been postponed; so has been my presentation of this work. I however got the opportunity to give a talk about it at MOVEP 2020 and at HIGHLIGHTS 2020.