The following pages link to Véronique Bruyère (Q213200):
Displaying 40 items.
- (Q4412103) (← links)
- (Q4418693) (← links)
- (Q4453443) (← links)
- (Q4453459) (← links)
- A completion algorithm for codes with bounded synchronization delay (Q4571942) (← links)
- Coding and strong coding in trace monoids (Q4596637) (← links)
- On the complexity of heterogeneous multidimensional quantitative games (Q4608663) (← links)
- Secure equilibria in weighted games (Q4635610) (← links)
- (Q4779147) (← links)
- (Q4818822) (← links)
- Visibly Pushdown Automata: Universality and Inclusion via Antichains (Q4910457) (← links)
- On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games (Q4913770) (← links)
- (Q4939574) (← links)
- (Q4942647) (← links)
- (Q4994885) (← links)
- (Q5009445) (← links)
- (Q5015274) (← links)
- Recognizable sets of numbers in nonstandard bases (Q5096330) (← links)
- (Q5140263) (← links)
- Formal language properties of hybrid systems with strong resets (Q5190079) (← links)
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases (Q5190326) (← links)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191509) (← links)
- Durations and parametric model-checking in timed automata (Q5277801) (← links)
- Real-Time Model-Checking: Parameters everywhere (Q5310683) (← links)
- Synthesis from LTL Specifications with Mean-Payoff Objectives (Q5326323) (← links)
- (Q5351977) (← links)
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems (Q5464753) (← links)
- Developments in Language Theory (Q5473665) (← links)
- Turán Graphs, Stability Number, and Fibonacci Index (Q5505651) (← links)
- The complexity of subgame perfect equilibria in quantitative reachability games (Q5875374) (← links)
- (Q5875382) (← links)
- Formal Modeling and Analysis of Timed Systems (Q5897953) (← links)
- On relevant equilibria in reachability games (Q5919688) (← links)
- Factorization of prefix-closed subsets of words (Q5948122) (← links)
- (Q6134271) (← links)
- Validating streaming JSON documents with learned VPAs (Q6535358) (← links)
- Learning realtime one-counter automata (Q6535566) (← links)
- Automata with timers (Q6536426) (← links)
- Pareto-rational verification (Q6587141) (← links)
- Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete (Q6623016) (← links)
