# Synthesizing Computable Functions from Rational Specifications over Infinite Words

@inproceedings{Filiot2021SynthesizingCF, title={Synthesizing Computable Functions from Rational Specifications over Infinite Words}, author={Emmanuel Filiot and Sarah Winter}, year={2021} }

The synthesis problem asks to automatically generate, if it exists, an algorithm from a specification of correct input-output pairs. In this paper, we consider the synthesis of computable functions of infinite words, for a classical Turing computability notion over infinite inputs. We consider specifications which are rational relations of infinite words, i.e., specifications defined by non-deterministic parity transducers. We prove that the synthesis problem of computable functions from…

## 2 Citations

Continuous rational functions are deterministic regular

- Computer ScienceArXiv
- 2022

The class of rational functions over infinite words which are also computable by a deterministic two-way transducer coincides with the class ofrational functions which are continuous, and this property can thus be decided.

Weakness Makes Muller Delay Games Hard

- Computer ScienceArXiv
- 2022

We show that solving delay games with winning conditions given by deterministic and nondeterministic weak Muller automata is 2EXPTIME-complete respectively 3EXPTIME-complete. Furthermore, doubly and…

## References

SHOWING 1-10 OF 35 REFERENCES

Synthesis of Computable Regular Functions of Infinite Words

- Mathematics, Computer ScienceCONCUR
- 2020

This paper proposes a decision procedure for the following synthesis problem: given a regular function f, is f computable and if it is, synthesize a Turing machine computing it and effectively characterise uniform continuity of regular functions, and relates it to the notion of uniform computability, which offers stronger efficiency guarantees.

Regular Transformations of Infinite Strings

- Computer Science, Mathematics2012 27th Annual IEEE Symposium on Logic in Computer Science
- 2012

This paper defines an equivalent generalization of the machine model of streaming string transducers to infinite strings and shows that type checking and functional equivalence are decidable for MSO-definable transformations of infinite strings.

Bounded synthesis

- Computer ScienceInternational Journal on Software Tools for Technology Transfer
- 2012

This article introduces the bounded synthesis approach, which makes it possible to traverse this immense search space in a structured manner and demonstrates that bounded synthesis solves many synthesis problems that were previously considered intractable.

Bounded Synthesis of Reactive Programs

- Computer ScienceATVA
- 2018

This paper presents a bounded synthesis approach that automatically constructs, from a given specification in linear-time temporal logic (LTL), a program in Madhusudan’s simple imperative language for reactive programs.

Uniformization in Automata Theory

- Computer Science, Mathematics
- 2013

It is shown that it is undecidable whether a given rational relation can be uniformized by a subsequential transducer and a decision procedure is provided for the case of automatic relations.

MSO definable string transductions and two-way finite-state transducers

- Computer ScienceTOCL
- 2001

It is shown that both classes of MSO definable string transductions are characterized in terms of Hennie machines, i.e., two-way finite-state transducers that are allowed to rewrite their input tape, but may visit each position of their input only a bounded number of times.

Solving sequential conditions by finite-state strategies

- Mathematics
- 1969

Our main purpose is to present an algorithm which decides whether or not a condition 𝕮(X, Y) stated in sequential calculus admits a finite automata solution, and produces one if it exists. This…

Automata logics, and infinite games: a guide to current research

- Computer Science
- 2002

The 19 chapters presented in this multi-author monograph give a consolidated overview of the research results achieved in the theory of automata, logics, and infinite games during the past 10 years.

Exponential determinization for ω-automata with strong-fairness acceptance condition (extended abstract)

- Computer ScienceSTOC '92
- 1992

The results imply that Streett automata can be used instead of Bu¨chi automata (with the weaker acceptance condition) without any loss of efficiency, and show an exponential determinization construction for any Streett Automaton.

On Equivalence and Uniformisation Problems for Finite Transducers

- MathematicsICALP
- 2016

This paper investigates stronger variants of inclusion, equivalence and sequential uniformisation, based on a general notion of transducer resynchronisation, and shows their decidability.