Synthesizing Computable Functions from Rational Specifications Over Infinite Words
From MaRDI portal
Publication:6195088
DOI10.1142/s012905412348009xOpenAlexW3192040540MaRDI QIDQ6195088
Publication date: 16 February 2024
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s012905412348009x
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synthesis with rational environments
- Solving parity games in big steps
- Assume-admissible synthesis
- Automata, logics, and infinite games. A guide to current research
- Good-enough synthesis
- Logic-Automata Connections for Transformations
- Regular Transformations of Infinite Strings
- Cooperative Reactive Synthesis
- Bounded Synthesis
- Degrees of Lookahead in Regular Infinite Games
- MSO definable string transductions and two-way finite-state transducers
- Handbook of Model Checking
- The Complexity of Rational Synthesis
- On equivalence and uniformisation problems for finite transducers
- An Approach to a Unified Theory of Automata
- Solving Sequential Conditions by Finite-State Strategies
- Classification of formal languages by functional binary transductions
- Assume-Guarantee Synthesis
- How Much Lookahead is Needed to Win Infinite Games?
- Bounded synthesis of reactive programs
