| Publication | Date of Publication | Type |
|---|
Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
| 2024-10-23 | Paper |
Pareto-rational verification
| 2024-08-13 | Paper |
Automata with timers
| 2024-05-03 | Paper |
Stackelberg-Pareto synthesis
ACM Transactions on Computational Logic | 2024-04-25 | Paper |
Learning realtime one-counter automata
| 2024-01-23 | Paper |
Validating streaming JSON documents with learned VPAs
| 2023-12-13 | Paper |
scientific article; zbMATH DE number 7730629 (Why is no real title available?)
| 2023-08-21 | Paper |
scientific article; zbMATH DE number 7649921 (Why is no real title available?)
| 2023-02-03 | Paper |
Energy mean-payoff games
| 2023-02-03 | Paper |
A game-theoretic approach for the synthesis of complex systems
| 2022-12-07 | Paper |
Recognizable sets of numbers in nonstandard bases
LATIN '95: Theoretical Informatics | 2022-08-16 | Paper |
scientific article; zbMATH DE number 7447731 (Why is no real title available?)
| 2021-12-17 | Paper |
Window parity games: an alternative approach toward parity games with time bounds
| 2021-12-07 | Paper |
Parameterized complexity of games with monotonically ordered \(\omega\)-regular objectives
| 2021-08-04 | Paper |
Expectations or guarantees? I want it all! A crossroad between games and MDPs
| 2021-06-22 | Paper |
Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives
Information and Computation | 2021-06-03 | Paper |
On relevant equilibria in reachability games
Journal of Computer and System Sciences | 2021-04-14 | Paper |
On the existence of weak subgame perfect equilibria
Information and Computation | 2021-02-08 | Paper |
The complexity of subgame perfect equilibria in quantitative reachability games
| 2020-12-15 | Paper |
Partial solvers for generalized parity games
| 2019-10-22 | Paper |
On relevant equilibria in reachability games
Lecture Notes in Computer Science | 2019-10-22 | Paper |
A completion algorithm for codes with bounded synchronization delay
Automata, Languages and Programming | 2018-07-04 | Paper |
Secure equilibria in weighted games
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
On the complexity of heterogeneous multidimensional games
| 2018-03-21 | Paper |
Coding and strong coding in trace monoids
STACS 95 | 2017-12-04 | Paper |
On equilibria in quantitative games with reachability/safety objectives
Theory of Computing Systems | 2017-11-07 | Paper |
Computer aided synthesis: a game-theoretic approach
| 2017-10-13 | Paper |
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes
Acta Informatica | 2017-10-09 | Paper |
scientific article; zbMATH DE number 6767615 (Why is no real title available?)
| 2017-08-31 | Paper |
Durations and parametric model-checking in timed automata
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
On the existence of weak subgame perfect equilibria
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
Information and Computation | 2017-05-12 | Paper |
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
| 2017-03-03 | Paper |
Synthesis from LTL specifications with mean-payoff objectives
Tools and Algorithms for the Construction and Analysis of Systems | 2013-08-05 | Paper |
On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
Logical Methods in Computer Science | 2013-04-09 | Paper |
Visibly pushdown automata: universality and inclusion via antichains
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Trees with given stability number and minimum number of stable sets
Graphs and Combinatorics | 2012-12-27 | Paper |
An aperiodicity problem for multiwords
RAIRO. Theoretical Informatics and Applications | 2012-08-31 | Paper |
Subgame perfection for equilibria in quantitative reachability games
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
Antichain-Based QBF Solving
Automated Technology for Verification and Analysis | 2011-10-07 | Paper |
Equilibria in quantitative reachability games
Computer Science – Theory and Applications | 2010-06-22 | Paper |
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
Logical Methods in Computer Science | 2010-03-15 | Paper |
Formal language properties of hybrid systems with strong resets
RAIRO - Theoretical Informatics and Applications | 2010-03-12 | Paper |
Fibonacci index and stability number of graphs: a polyhedral study
Journal of Combinatorial Optimization | 2009-12-02 | Paper |
On the size of Boyer-Moore automata
Theoretical Computer Science | 2009-10-09 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
Tree Automata and Automata on Linear Orderings
RAIRO - Theoretical Informatics and Applications | 2009-05-06 | Paper |
Turán Graphs, Stability Number, and Fibonacci Index
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
Automata, Languages and Programming | 2008-08-19 | Paper |
On the optimal reachability problem of weighted timed automata
Formal Methods in System Design | 2007-10-11 | Paper |
Real-Time Model-Checking: Parameters everywhere
Logical Methods in Computer Science | 2007-10-11 | Paper |
Automata on linear orderings
Journal of Computer and System Sciences | 2007-01-22 | Paper |
Formal Modeling and Analysis of Timed Systems
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2006-06-23 | Paper |
On model-checking timed automata with stopwatch observers
Information and Computation | 2006-06-09 | Paper |
Hierarchy among automata on linear orderings
Theory of Computing Systems | 2006-02-08 | Paper |
Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
Lecture Notes in Computer Science | 2005-08-19 | Paper |
Words derivated from Sturmian words
Theoretical Computer Science | 2005-08-01 | Paper |
Sturmian words and a criterium by Michaux-Villemaire
Theoretical Computer Science | 2005-06-30 | Paper |
scientific article; zbMATH DE number 2102735 (Why is no real title available?)
| 2004-09-24 | Paper |
scientific article; zbMATH DE number 2051168 (Why is no real title available?)
| 2004-03-07 | Paper |
scientific article; zbMATH DE number 2051153 (Why is no real title available?)
| 2004-03-07 | Paper |
scientific article; zbMATH DE number 1962855 (Why is no real title available?)
| 2003-08-11 | Paper |
scientific article; zbMATH DE number 1948490 (Why is no real title available?)
| 2003-07-13 | Paper |
Cumulative defect.
Theoretical Computer Science | 2003-01-22 | Paper |
scientific article; zbMATH DE number 1834651 (Why is no real title available?)
| 2002-11-25 | Paper |
Factorization of prefix-closed subsets of words
Séminaire Lotharingien de Combinatoire | 2001-11-06 | Paper |
scientific article; zbMATH DE number 1400021 (Why is no real title available?)
| 2000-06-13 | Paper |
scientific article; zbMATH DE number 1414310 (Why is no real title available?)
| 2000-03-16 | Paper |
Maximal bifix codes
Theoretical Computer Science | 1999-06-21 | Paper |
A proof of Choffrut's theorem on subsequential functions
Theoretical Computer Science | 1999-04-28 | Paper |
On maximal codes with bounded synchronization delay
Theoretical Computer Science | 1999-01-12 | Paper |
The meet operation in the lattice of codes
Theoretical Computer Science | 1998-08-13 | Paper |
Bertrand numeration systems and recognizability
Theoretical Computer Science | 1998-07-22 | Paper |
On the Cobham-Semenov theorem
Theory of Computing Systems | 1997-09-07 | Paper |
scientific article; zbMATH DE number 1047871 (Why is no real title available?)
| 1997-08-12 | Paper |
Any lifting of a trace coding is a word coding
Information and Computation | 1997-04-29 | Paper |
On some decision problems for trace codings
Theoretical Computer Science | 1997-02-28 | Paper |
Automata and numeration systems
Séminaire Lotharingien de Combinatoire | 1996-08-27 | Paper |
Synchronization and decomposability for a family of codes. II
Discrete Mathematics | 1996-07-24 | Paper |
Correction to: Logic and \(p\)-recognizable sets of integers
Bulletin of the Belgian Mathematical Society - Simon Stevin | 1995-03-26 | Paper |
Logic and \(p\)-recognizable sets of integers
Bulletin of the Belgian Mathematical Society - Simon Stevin | 1995-01-22 | Paper |
scientific article; zbMATH DE number 176765 (Why is no real title available?)
| 1993-05-18 | Paper |
SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES
International Journal of Algebra and Computation | 1993-03-28 | Paper |
Maximal codes with bounded deciphering delay
Theoretical Computer Science | 1992-06-26 | Paper |
On completion of codes with finite deciphering delay
European Journal of Combinatorics | 1990-01-01 | Paper |
About prefix sets of words
Journal of Combinatorial Theory. Series A | 1989-01-01 | Paper |
Factorisation des ensembles préfixiels
RAIRO - Theoretical Informatics and Applications | 1989-01-01 | Paper |
An answer to a question about finite maximal prefix sets of words
Theoretical Computer Science | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4060747 (Why is no real title available?)
| 1988-01-01 | Paper |
Maximal prefix products
Semigroup Forum | 1987-01-01 | Paper |
