On Computability of Data Word Functions Defined by Transducers

02/19/2020
by   Léo Exibard, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/18/2021

Computability of Data-Word Transductions over Different Data Domains

In this paper, we investigate the problem of synthesizing computable fun...
research
05/15/2019

Deciding the Computability of Regular Functions over Infinite Words

The class of regular functions from infinite words to infinite words is ...
research
02/13/2023

Deterministic regular functions of infinite words

Regular functions of infinite words are (partial) functions realized by ...
research
04/30/2019

Quantitative continuity and computable analysis in Coq

We give a number of formal proofs of theorems from the field of computab...
research
12/07/2021

Computational complexity of problems for deterministic presentations of sofic shifts

Sofic shifts are symbolic dynamical systems defined by the set of bi-inf...
research
12/17/2019

Function Naming in Stripped Binaries Using Neural Networks

In this paper we investigate the problem of automatically naming pieces ...
research
03/09/2021

Continuous Uniformization of Rational Relations and Synthesis of Computable Functions

A uniformizer of a binary relation is a function whose graph is containe...

Please sign up or login with your details

Forgot password? Click here to reset