[PDF][PDF] Synthesis of computable regular functions of infinite words

V Dave, E Filiot, S Krishna… - Logical Methods in …, 2022 - lmcs.episciences.org
Regular functions from infinite words to infinite words can be equivalently specified by MSO-
transducers, streaming ω-string transducers as well as deterministic twoway transducers …

Automatic synthesis of systems with data

L Exibard - 2021 - hal.science
A reactive system is a system that continuously interacts with its environment. The
environment provides an input signal, to which the system reacts with an output signal, and …

Computability of Data-Word Transductions over Different Data Domains

L Exibard, E Filiot, N Lhote… - Logical Methods in …, 2022 - lmcs.episciences.org
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 …

Transductions: Resources and characterizations

O Gauwin - 2020 - theses.hal.science
Transducers define word-to-word transformations by extending automata with outputs. We
study some decision problems related to transducers. First, we characterize some resources …

[PDF][PDF] Léo EXIBARD

SAS avec Données - 2021 - igm.univ-mlv.fr
In the classical setting, the set of signals available to the machine is assumed to be finite.
However, this assumption is not realistic for modelling systems that process data from a …

What You Must Remember When Transforming Datawords

M Praveen - arXiv preprint arXiv:2005.02596, 2020 - arxiv.org
Streaming Data String Transducers (SDSTs) were introduced to model a class of imperative
and a class of functional programs, manipulating lists of data items. These can be used to …