On Computability of Data Word Functions Defined by Transducers
Abstract
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data omega-words). The notion of computability is defined through Turing machines with infinite inputs which can produce the corresponding infinite outputs in the limit. We use non-deterministic transducers equipped with registers, an extension of register automata with outputs, to specify functions. Such transducers may not define functions but more generally relations of data omega-words, and we show that it is PSpace-complete to test whether a given transducer defines a function. Then, given a function defined by some register transducer, we show that it is decidable (and again, PSpace-complete) whether such function is computable. As for the known finite alphabet case, we show that computability and continuity coincide for functions defined by register transducers, and show how to decide continuity. We also define a subclass for which those problems are solvable in polynomial time.
Cite
@article{arxiv.2002.08203,
title = {On Computability of Data Word Functions Defined by Transducers},
author = {Léo Exibard and Emmanuel Filiot and Pierre-Alain Reynier},
journal= {arXiv preprint arXiv:2002.08203},
year = {2020}
}