The following pages link to Emmanuel Filiot (Q453495):
Displaying 50 items.
- Antichains and compositional algorithms for LTL synthesis (Q453498) (← links)
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games (Q528191) (← links)
- Doomsday equilibria for omega-regular games (Q528193) (← links)
- A pattern logic for automata with outputs (Q1622976) (← links)
- Decision problems of tree transducers with origin (Q1641005) (← links)
- Visibly pushdown transducers (Q1672009) (← links)
- Copyful streaming string transducers (Q1685783) (← links)
- On computability of data word functions defined by transducers (Q2200823) (← links)
- Two-way Parikh automata with a visibly pushdown stack (Q2289072) (← links)
- Visibly Pushdown Transducers with Look-Ahead (Q2891373) (← links)
- (Q2911634) (← links)
- Logic-Automata Connections for Transformations (Q2937387) (← links)
- Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games (Q2965484) (← links)
- Finite-Valued Weighted Automata. (Q2978508) (← links)
- First-order definable string transformations (Q2978509) (← links)
- Regular Transformations of Infinite Strings (Q2986782) (← links)
- Decision Problems of Tree Transducers with Origin (Q3449477) (← links)
- Multi-sequential Word Relations (Q3451110) (← links)
- Tree Automata with Global Constraints (Q3533021) (← links)
- Efficient Enumeration for Conjunctive Queries over X-underbar Structures (Q3586035) (← links)
- Iterated Regret Minimization in Game Graphs (Q3586096) (← links)
- Properties of Visibly Pushdown Transducers (Q3586097) (← links)
- TREE AUTOMATA WITH GLOBAL CONSTRAINTS (Q3586405) (← links)
- Satisfiability of a Spatial Logic with Tree Variables (Q3608409) (← links)
- An Antichain Algorithm for LTL Realizability (Q3636866) (← links)
- The Complexity of Rational Synthesis (Q4598263) (← links)
- On equivalence and uniformisation problems for finite transducers (Q4598267) (← links)
- Two-Way Visibly Pushdown Automata and Transducers (Q4635877) (← links)
- First-order definability of rational transductions (Q4635895) (← links)
- (Q4636560) (← links)
- Multi-Sequential Word Relations (Q4640041) (← links)
- Compositional Algorithms for LTL Synthesis (Q4931287) (← links)
- Copyful Streaming String Transducers (Q4989167) (← links)
- (Q4994131) (← links)
- (Q4994885) (← links)
- (Q5005148) (← links)
- Register Transducers Are Marble Transducers (Q5089194) (← links)
- (Q5089282) (← links)
- (Q5089310) (← links)
- (Q5090969) (← links)
- (Q5094153) (← links)
- (Q5101342) (← links)
- (Q5144642) (← links)
- Logics for Word Transductions with Synthesis (Q5145302) (← links)
- Rational Synthesis Under Imperfect Information (Q5145317) (← links)
- (Q5207053) (← links)
- From Two-Way to One-Way Finite State Transducers (Q5271084) (← links)
- Synthesis from LTL Specifications with Mean-Payoff Objectives (Q5326323) (← links)
- (Q5376652) (← links)
- (Q5856426) (← links)
