| 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 | 2024-04-25 | Paper |
| Learning realtime one-counter automata | 2024-01-23 | Paper |
| Validating streaming JSON documents with learned VPAs | 2023-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6134271 | 2023-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875374 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875382 | 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 | 2022-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3384875 | 2021-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5015274 | 2021-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009445 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4994885 | 2021-06-22 | Paper |
| Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives | 2021-06-03 | Paper |
| On relevant equilibria in reachability games | 2021-04-14 | Paper |
| On the existence of weak subgame perfect equilibria | 2021-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140263 | 2020-12-15 | Paper |
| Partial solvers for generalized parity games | 2019-10-22 | Paper |
| On relevant equilibria in reachability games | 2019-10-22 | Paper |
| A completion algorithm for codes with bounded synchronization delay | 2018-07-04 | Paper |
| Secure equilibria in weighted games | 2018-04-23 | Paper |
| On the complexity of heterogeneous multidimensional quantitative games | 2018-03-21 | Paper |
| Coding and strong coding in trace monoids | 2017-12-04 | Paper |
| On equilibria in quantitative games with reachability/safety objectives | 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 | 2017-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5351977 | 2017-08-31 | Paper |
| Durations and parametric model-checking in timed automata | 2017-07-12 | Paper |
| On the Existence of Weak Subgame Perfect Equilibria | 2017-05-19 | Paper |
| Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games | 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 | 2013-08-05 | Paper |
| On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games | 2013-04-09 | Paper |
| Visibly Pushdown Automata: Universality and Inclusion via Antichains | 2013-03-18 | Paper |
| Trees with given stability number and minimum number of stable sets | 2012-12-27 | Paper |
| An aperiodicity problem for multiwords | 2012-08-31 | Paper |
| Subgame Perfection for Equilibria in Quantitative Reachability Games | 2012-06-22 | Paper |
| Antichain-Based QBF Solving | 2011-10-07 | Paper |
| Equilibria in Quantitative Reachability Games | 2010-06-22 | Paper |
| On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases | 2010-03-15 | Paper |
| Formal language properties of hybrid systems with strong resets | 2010-03-12 | Paper |
| Fibonacci index and stability number of graphs: a polyhedral study | 2009-12-02 | Paper |
| On the size of Boyer-Moore automata | 2009-10-09 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| Tree Automata and Automata on Linear Orderings | 2009-05-06 | Paper |
| Turán Graphs, Stability Number, and Fibonacci Index | 2009-01-27 | Paper |
| On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases | 2008-08-19 | Paper |
| On the optimal reachability problem of weighted timed automata | 2007-10-11 | Paper |
| Real-Time Model-Checking: Parameters everywhere | 2007-10-11 | Paper |
| Automata on linear orderings | 2007-01-22 | Paper |
| Formal Modeling and Analysis of Timed Systems | 2006-11-14 | Paper |
| Developments in Language Theory | 2006-06-23 | Paper |
| On model-checking timed automata with stopwatch observers | 2006-06-09 | Paper |
| Hierarchy among automata on linear orderings | 2006-02-08 | Paper |
| Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems | 2005-08-19 | Paper |
| Words derivated from Sturmian words | 2005-08-01 | Paper |
| Sturmian words and a criterium by Michaux-Villemaire | 2005-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818822 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453459 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453443 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418693 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412103 | 2003-07-13 | Paper |
| Cumulative defect. | 2003-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779147 | 2002-11-25 | Paper |
| Factorization of prefix-closed subsets of words | 2001-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4939574 | 2000-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942647 | 2000-03-16 | Paper |
| Maximal bifix codes | 1999-06-21 | Paper |
| A proof of Choffrut's theorem on subsequential functions | 1999-04-28 | Paper |
| On maximal codes with bounded synchronization delay | 1999-01-12 | Paper |
| The meet operation in the lattice of codes | 1998-08-13 | Paper |
| Bertrand numeration systems and recognizability | 1998-07-22 | Paper |
| On the Cobham-Semenov theorem | 1997-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347949 | 1997-08-12 | Paper |
| Any lifting of a trace coding is a word coding | 1997-04-29 | Paper |
| On some decision problems for trace codings | 1997-02-28 | Paper |
| Automata and numeration systems | 1996-08-27 | Paper |
| Synchronization and decomposability for a family of codes. II | 1996-07-24 | Paper |
| Correction to: Logic and \(p\)-recognizable sets of integers | 1995-03-26 | Paper |
| Logic and \(p\)-recognizable sets of integers | 1995-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036595 | 1993-05-18 | Paper |
| SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES | 1993-03-28 | Paper |
| Maximal codes with bounded deciphering delay | 1992-06-26 | Paper |
| On completion of codes with finite deciphering delay | 1990-01-01 | Paper |
| About prefix sets of words | 1989-01-01 | Paper |
| Factorisation des ensembles préfixiels | 1989-01-01 | Paper |
| An answer to a question about finite maximal prefix sets of words | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795249 | 1988-01-01 | Paper |
| Maximal prefix products | 1987-01-01 | Paper |
