Computability of Data-Word Transductions over Different Data Domains

01/18/2021
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 ω-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 describe specifications. Being non-deterministic, such transducers may not define functions but more generally relations of data ω-words. In order to increase the expressive power of these machines, we even allow guessing of arbitrary data values when updating their registers. For functions over data ω-words, we identify a sufficient condition (the possibility of determining the next letter to be outputted, which we call next letter problem) under which computability (resp. uniform computability) and continuity (resp. uniform continuity) coincide. We focus on two kinds of data domains: first, the general setting of oligomorphic data, which encompasses any data domain with equality, as well as the setting of rational numbers with linear order; and second, the set of natural numbers equipped with linear order. For both settings, we prove that functionality, i.e. determining whether the relation recognized by the transducer is actually a function, is decidable. We also show that the so-called next letter problem is decidable, yielding equivalence between (uniform) continuity and (uniform) computability. Last, we provide characterizations of (uniform) continuity, which allow us to prove that these notions, and thus also (uniform) computability, are decidable. We even show that all these decision problems are PSpace-complete for (N,<) and for a large class of oligomorphic data domains, including for instance (Q,<).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/19/2020

On Computability of Data Word Functions Defined by Transducers

In this paper, we investigate the problem of synthesizing computable fun...
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...
research
01/20/2020

Streaming Transformations of Infinite Ordered-Data Words

In this paper, we define streaming register transducer (SRT), a one-way,...
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
09/23/2019

On uniform continuity of posterior distributions

In the setting of dominated statistical models, we provide conditions yi...
research
12/17/2017

Benford's Law and First Letter of Word

A universal First-Letter Law (FLL) is derived and described. It predicts...

Please sign up or login with your details

Forgot password? Click here to reset