Synthesizing Computable Functions from Rational Specifications Over Infinite Words
From MaRDI portal
Cites work
- An Approach to a Unified Theory of Automata
- Assume-admissible synthesis
- Assume-Guarantee Synthesis
- Automata, logics, and infinite games. A guide to current research
- Bounded Synthesis
- Bounded synthesis of reactive programs
- Classification of formal languages by functional binary transductions
- Cooperative reactive synthesis
- Degrees of lookahead in regular infinite games
- Elements of automata theory. Translated from the French by Reuben Thomas
- Good-enough synthesis
- Handbook of model checking
- How much lookahead is needed to win infinite games?
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 486692 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1408334 (Why is no real title available?)
- scientific article; zbMATH DE number 7559499 (Why is no real title available?)
- scientific article; zbMATH DE number 6741931 (Why is no real title available?)
- scientific article; zbMATH DE number 7799621 (Why is no real title available?)
- Logic-automata connections for transformations
- MSO definable string transductions and two-way finite-state transducers
- On equivalence and uniformisation problems for finite transducers
- Regular transformations of infinite strings
- Solving parity games in big steps
- Solving Sequential Conditions by Finite-State Strategies
- Synthesis with rational environments
- The complexity of rational synthesis
Cited in
(2)
This page was built for publication: Synthesizing Computable Functions from Rational Specifications Over Infinite Words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6195088)
