The following pages link to Véronique Bruyère (Q213200):
Displaying 50 items.
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games (Q528191) (← links)
- (Q557918) (redirect page) (← links)
- Sturmian words and a criterium by Michaux-Villemaire (Q557919) (← links)
- On some decision problems for trace codings (Q672324) (← links)
- Any lifting of a trace coding is a word coding (Q675053) (← links)
- On the Cobham-Semenov theorem (Q675868) (← links)
- On the size of Boyer-Moore automata (Q732040) (← links)
- On completion of codes with finite deciphering delay (Q757324) (← links)
- Hierarchy among automata on linear orderings (Q814934) (← links)
- Automata on linear orderings (Q859978) (← links)
- Fibonacci index and stability number of graphs: a polyhedral study (Q1041432) (← links)
- An answer to a question about finite maximal prefix sets of words (Q1107641) (← links)
- About prefix sets of words (Q1122006) (← links)
- The meet operation in the lattice of codes (Q1127316) (← links)
- Maximal codes with bounded deciphering delay (Q1177932) (← links)
- On maximal codes with bounded synchronization delay (Q1275457) (← links)
- A proof of Choffrut's theorem on subsequential functions (Q1285595) (← links)
- Maximal bifix codes (Q1292485) (← links)
- Logic and \(p\)-recognizable sets of integers (Q1326952) (← links)
- Correction to: Logic and \(p\)-recognizable sets of integers (Q1344736) (← links)
- Bertrand numeration systems and recognizability (Q1391295) (← links)
- On equilibria in quantitative games with reachability/safety objectives (Q1678747) (← links)
- Maximal prefix products (Q1821877) (← links)
- Cumulative defect. (Q1853734) (← links)
- Synchronization and decomposability for a family of codes. II (Q1893165) (← links)
- Automata and numeration systems (Q1921472) (← links)
- Trees with given stability number and minimum number of stable sets (Q1926055) (← links)
- Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives (Q2029600) (← links)
- A game-theoretic approach for the synthesis of complex systems (Q2104251) (← links)
- On the existence of weak subgame perfect equilibria (Q2225594) (← links)
- Partial solvers for generalized parity games (Q2330591) (← links)
- On the optimal reachability problem of weighted timed automata (Q2385195) (← links)
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes (Q2407982) (← links)
- Computer aided synthesis: a game-theoretic approach (Q2408790) (← links)
- Words derivated from Sturmian words (Q2484435) (← links)
- On model-checking timed automata with stopwatch observers (Q2492187) (← links)
- Subgame Perfection for Equilibria in Quantitative Reachability Games (Q2892777) (← links)
- An aperiodicity problem for multiwords (Q2911425) (← links)
- Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games (Q2965484) (← links)
- On the Existence of Weak Subgame Perfect Equilibria (Q2988365) (← links)
- Antichain-Based QBF Solving (Q3172913) (← links)
- (Q3384875) (← links)
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases (Q3519495) (← links)
- Equilibria in Quantitative Reachability Games (Q3569732) (← links)
- Tree Automata and Automata on Linear Orderings (Q3625696) (← links)
- (Q3795249) (← links)
- Factorisation des ensembles préfixiels (Q3833638) (← links)
- SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES (Q4029499) (← links)
- (Q4036595) (← links)
- (Q4347949) (← links)
