Synthesizing Computable Functions from Rational Specifications Over Infinite Words (Q6195088): Difference between revisions

@@ Property / cites work @@
+Good-enough synthesis
@@ Property / cites work: Good-enough synthesis / rank @@
+Normal rank
@@ Property / cites work @@
+Regular Transformations of Infinite Strings
@@ Property / cites work: Regular Transformations of Infinite Strings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4275432
@@ Property / cites work: Q4275432 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3859267
@@ Property / cites work: Q3859267 / rank @@
+Normal rank
@@ Property / cites work @@
+Cooperative Reactive Synthesis
@@ Property / cites work: Cooperative Reactive Synthesis / rank @@
+Normal rank
@@ Property / cites work @@
+Assume-admissible synthesis
@@ Property / cites work: Assume-admissible synthesis / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Sequential Conditions by Finite-State Strategies
+Normal rank
@@ Property / cites work @@
+Q5271416
@@ Property / cites work: Q5271416 / rank @@
+Normal rank
@@ Property / cites work @@
+Assume-Guarantee Synthesis
@@ Property / cites work: Assume-Guarantee Synthesis / rank @@
+Normal rank
@@ Property / cites work @@
+Q4941148
@@ Property / cites work: Q4941148 / rank @@
+Normal rank
@@ Property / cites work @@
+Handbook of Model Checking
@@ Property / cites work: Handbook of Model Checking / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Rational Synthesis
@@ Property / cites work: The Complexity of Rational Synthesis / rank @@
+Normal rank
@@ Property / cites work @@
+Q5089310
@@ Property / cites work: Q5089310 / rank @@
+Normal rank
@@ Property / cites work @@
+MSO definable string transductions and two-way finite-state transducers
+Normal rank
@@ Property / cites work @@
+Logic-Automata Connections for Transformations
@@ Property / cites work: Logic-Automata Connections for Transformations / rank @@
+Normal rank
@@ Property / cites work @@
+On equivalence and uniformisation problems for finite transducers
+Normal rank
@@ Property / cites work @@
+Q6187060
@@ Property / cites work: Q6187060 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded Synthesis
@@ Property / cites work: Bounded Synthesis / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded synthesis of reactive programs
@@ Property / cites work: Bounded synthesis of reactive programs / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, logics, and infinite games. A guide to current research
+Normal rank
@@ Property / cites work @@
+Degrees of Lookahead in Regular Infinite Games
@@ Property / cites work: Degrees of Lookahead in Regular Infinite Games / rank @@
+Normal rank
@@ Property / cites work @@
+An Approach to a Unified Theory of Automata
@@ Property / cites work: An Approach to a Unified Theory of Automata / rank @@
+Normal rank
@@ Property / cites work @@
+How Much Lookahead is Needed to Win Infinite Games?
+Normal rank
@@ Property / cites work @@
+Classification of formal languages by functional binary transductions
+Normal rank
@@ Property / cites work @@
+Synthesis with rational environments
@@ Property / cites work: Synthesis with rational environments / rank @@
+Normal rank
@@ Property / cites work @@
+Q4205072
@@ Property / cites work: Q4205072 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3644388
@@ Property / cites work: Q3644388 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving parity games in big steps
@@ Property / cites work: Solving parity games in big steps / rank @@
+Normal rank
@@ Property / cites work @@
+Q4485693
@@ Property / cites work: Q4485693 / rank @@
+Normal rank