Deciding the Computability of Regular Functions over Infinite Words

05/15/2019
by   V. Dave, et al.
0

The class of regular functions from infinite words to infinite words is characterised by MSO-transducers, streaming ω-string transducers as well as deterministic two-way transducers with look-ahead. In their one-way restriction, the latter transducers define the class of rational functions. This paper proposes a decision procedure for the fundamental question : given a regular function f, is f computable (by a Turing machine with infinite input)? For regular functions, we show that computability is equivalent to continuity, and therefore the problem boils down to deciding continuity. We establish a generic characterisation of continuity for functions preserving regular languages under inverse image (such as regular functions). We exploit this characterisation to show the decidability of continuity (and hence computability) of rational functions in NLogSpace (it was already known to be in PTime by Prieur), and of regular functions.

READ FULL TEXT
research
02/13/2023

Deterministic regular functions of infinite words

Regular functions of infinite words are (partial) functions realized by ...
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
02/28/2018

Continuity and Rational Functions

A word-to-word function is continuous for a class of languages V if its ...
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
09/10/2018

An Effective Property of ω-Rational Functions

We prove that ω-regular languages accepted by Büchi or Muller automata s...
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
04/21/2023

Revisiting Membership Problems in Subclasses of Rational Relations

We revisit the membership problem for subclasses of rational relations o...

Please sign up or login with your details

Forgot password? Click here to reset