Synthesis of Data Word Transducers
From MaRDI portal
Recommendations
Cites work
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Bisimilarity in Fresh-Register Automata
- Bounded synthesis of register transducers
- Deciding parity games in quasipolynomial time
- Finite state machines for strings over infinite alphabets
- Finite-memory automata
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Graph Games and Reactive Synthesis
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- Logics for word transductions with synthesis
- Register-bounded synthesis
- Regular Transformations of Data Words Through Origin Information
- Solving Sequential Conditions by Finite-State Strategies
- Synthesis with Identifiers
- Two-variable logic with two order relations
Cited in
(9)- Parameterized synthesis for fragments of first-order logic over data words
- On synthesis of specifications with arithmetic
- Computability of data-word transductions over different data domains
- Register-bounded synthesis
- Church synthesis on register automata over linearly ordered data domains
- A generic solution to register-bounded synthesis with an application to discrete orders
- Round- and context-bounded control of dynamic pushdown systems
- What you must remember when transforming datawords
- Church synthesis on register automata over linearly ordered data domains
This page was built for publication: Synthesis of Data Word Transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875385)
