Synthesis of Data Word Transducers

DOI10.4230/LIPIcs.CONCUR.2019.24OpenAlexW4288255922MaRDI QIDQ5875385

Emmanuel Filiot, Pierre-Alain Reynier, Léo Exibard

Publication date: 3 February 2023

Full work available at URL: https://hal.science/hal-02439660

zbMATH Keywords

synthesistransducersdata wordsregister automata

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Unnamed Item, On Synthesis of Specifications with Arithmetic, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Finite-memory automata
• Regular Transformations of Data Words Through Origin Information
• Synthesis with Identifiers
• Graph Games and Reactive Synthesis
• Playing with Repetitions in Data Words Using Energy Games
• Automata and Logics for Words and Trees over an Infinite Alphabet
• Bisimilarity in Fresh-Register Automata
• Deciding parity games in quasipolynomial time
• Logics for Word Transductions with Synthesis
• Finite state machines for strings over infinite alphabets
• From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
• Solving Sequential Conditions by Finite-State Strategies
• Two-Variable Logic with Two Order Relations
• Bounded synthesis of register transducers