| Publication | Date of Publication | Type |
|---|
| A complexity approach to tree algebras: the polynomial case | 2024-08-06 | Paper |
From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
TheoretiCS | 2024-07-03 | Paper |
| On the size of good-for-games Rabin automata and its link with the memory in Muller games | 2024-06-24 | Paper |
Playing Safe, Ten Years Later
Logical Methods in Computer Science | 2024-03-11 | Paper |
Cost Automata, Safe Schemes, and Downward Closures
Fundamenta Informaticae | 2023-05-19 | Paper |
scientific article; zbMATH DE number 7650917 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
The Theory of Universal Graphs for Infinite Duration Games
Logical Methods in Computer Science | 2022-10-06 | Paper |
On Reachability Problems for Low-Dimensional Matrix Semigroups
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7471672 (Why is no real title available?)
(available as arXiv preprint) | 2022-02-09 | Paper |
| scientific article; zbMATH DE number 7471672 (Why is no real title available?) | 2022-02-09 | Paper |
| The factorisation forest theorem | 2022-02-04 | Paper |
| Perfect half space games | 2021-01-19 | Paper |
Perfect half space games
(available as arXiv preprint) | 2021-01-19 | Paper |
| Logic and regular cost functions | 2021-01-19 | Paper |
| Controlling a random population | 2020-09-23 | Paper |
scientific article; zbMATH DE number 7204386 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-26 | Paper |
scientific article; zbMATH DE number 7199591 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-12 | Paper |
| scientific article; zbMATH DE number 7199591 (Why is no real title available?) | 2020-05-12 | Paper |
| Universal graphs and good for games automata: new tools for infinite duration games | 2020-01-28 | Paper |
An algebraic approach to MSO-definability on countable linear orderings
Journal of Symbolic Logic | 2018-10-26 | Paper |
scientific article; zbMATH DE number 6917169 (Why is no real title available?)
(available as arXiv preprint) | 2018-08-13 | Paper |
Games with bound guess actions
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
The complexity of boundedness for guarded logics
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Two-way cost automata and cost logics over infinite trees
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 |
| Cost functions definable by min/max automata | 2018-01-24 | Paper |
| On a fragment of AMSO and tiling systems | 2018-01-24 | Paper |
| The bridge between regular cost functions and omega-regular languages | 2017-12-19 | Paper |
Boundedness in languages of infinite words
(available as arXiv preprint) | 2017-12-11 | Paper |
| Automata and program analysis | 2017-11-22 | Paper |
| Fragments of fixpoint logic on data words | 2017-07-13 | Paper |
Magnitude monadic logic over words and the use of relative internal set theory
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
| Playing Safe | 2017-04-25 | Paper |
| Generalized data automata and fixpoint logic | 2017-04-25 | Paper |
| Deciding the weak definability of Büchi definable tree languages | 2017-02-02 | Paper |
| Approximate comparison of distance automata | 2017-01-30 | Paper |
| Combinatorial expressions and lower bounds | 2017-01-24 | Paper |
Approximate comparison of functions computed by distance automata
Theory of Computing Systems | 2016-06-03 | Paper |
Limited set quantifiers over countable linear orderings
Automata, Languages, and Programming | 2015-11-04 | Paper |
Logics with rigidly guarded data tests
Logical Methods in Computer Science | 2015-10-29 | Paper |
Unambiguity in automata theory
Descriptional Complexity of Formal Systems | 2015-08-07 | Paper |
Enforcing trace properties by program transformation
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-03-17 | Paper |
Size-Change Abstraction and Max-Plus Automata
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Asymptotic Monadic Second-Order Logic
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Composition with Algebra at the Background
Computer Science – Theory and Applications | 2013-06-14 | Paper |
On the use of guards for logics with data
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Regular languages of words over countable linear orderings
Automata, Languages and Programming | 2011-07-07 | Paper |
Green's relations and their use in automata theory
Language and Automata Theory and Applications | 2011-06-03 | Paper |
| Logical theories and compatible operations | 2011-03-30 | Paper |
Regular temporal cost functions
Automata, Languages and Programming | 2010-09-07 | Paper |
Tree-walking automata do not recognize all regular languages
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Factorization forests for infinite words and applications to countable scattered linear orderings
Theoretical Computer Science | 2010-02-09 | Paper |
The Theory of Stabilisation Monoids and Regular Cost Functions
Automata, Languages and Programming | 2009-07-14 | Paper |
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
Automata, Languages and Programming | 2009-07-14 | Paper |
Tree-Walking Automata Do Not Recognize All Regular Languages
SIAM Journal on Computing | 2009-04-30 | Paper |
The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
Computer Science Logic | 2008-11-20 | Paper |
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
Automata, Languages and Programming | 2008-08-19 | Paper |
Factorisation Forests for Infinite Words
Fundamentals of Computation Theory | 2008-02-26 | Paper |
A Combinatorial Theorem for Trees
Automata, Languages and Programming | 2007-11-28 | Paper |
Transforming structures by set interpretations
Logical Methods in Computer Science | 2007-10-11 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
On the positional determinacy of edge-labeled games
Theoretical Computer Science | 2006-03-24 | Paper |
Tree-walking automata cannot be determinized
Theoretical Computer Science | 2006-03-20 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
| scientific article; zbMATH DE number 2086614 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2038741 (Why is no real title available?) | 2004-02-08 | Paper |
