Transducers

Synthesis over Infinite Domains through Machines with Registers @ Journées GT Vérif 2021 (Invited talk)
Synthesis can be lifted to infinite domains through register automata, targeting register transducers implementations.
Léo Exibard
Nov 18, 2021
PDF Details
Synthesis of Data Word Transducers (LMCS Special Issue dedicated to CONCUR 2019)
Register automata are a counterpart of finite automata over data words. Synthesis algorithms can (sometimes) be extended to them.
Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
PDF Cite Poster Slides DOI Conference
Synthesis of Data Word Transducers (CONCUR 2019)
Register automata are a counterpart of finite automata over data words. Synthesis algorithms can (sometimes) be extended to them.
Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
PDF Cite Poster Slides DOI Journal
The Complexity of Transducer Synthesis from Multi-Sequential Specifications (MFCS 2018)
Multi-sequential specifications are recognised by unions of sequential transducers. Their synthesis problem is PSpace-complete.
Léo Exibard, Emmanuel Filiot, Ismaël Jecker
PDF Cite Slides DOI