| Publication | Date of Publication | Type |
|---|
| Separation and covering for group based concatenation hierarchies | 2024-12-19 | Paper |
| The amazing mixed polynomial closure and its applications to two-variable first-order logic | 2024-12-06 | Paper |
| A generic polynomial time approach to separation by first-order logic without quantifier alternation | 2024-09-12 | Paper |
All about unambiguous polynomial closure
TheoretiCS | 2024-07-03 | Paper |
How many times do you need to go back to the future in unary temporal logic?
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Characterizing level one in group-based concatenation hierarchies
(available as arXiv preprint) | 2022-11-11 | Paper |
The Complexity of Separation for Levels in Concatenation Hierarchies
(available as arXiv preprint) | 2022-07-21 | Paper |
On All Things Star-Free
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7407796 (Why is no real title available?)
(available as arXiv preprint) | 2021-10-08 | Paper |
| scientific article; zbMATH DE number 7407796 (Why is no real title available?) | 2021-10-08 | Paper |
| Separating Without Any Ambiguity. | 2021-07-28 | Paper |
| Separation for dot-depth two | 2021-01-19 | Paper |
| Deciding classes of regular languages: the covering approach | 2020-07-27 | Paper |
Adding Successor
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
Going Higher in First-Order Quantifier Alternation Hierarchies on Words
Journal of the ACM | 2019-11-21 | Paper |
Regular tree languages in low levels of the Wadge hierarchy
(available as arXiv preprint) | 2019-09-13 | Paper |
Generic results for concatenation hierarchies
Theory of Computing Systems | 2019-07-04 | Paper |
Covering and separation for logical fragments with modular predicates
(available as arXiv preprint) | 2019-05-17 | Paper |
Separating regular languages with two quantifier alternations
(available as arXiv preprint) | 2018-11-30 | Paper |
The covering problem
(available as arXiv preprint) | 2018-08-15 | Paper |
Separating regular languages with first-order logic
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 |
Separating regular languages with two quantifiers alternations
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| scientific article; zbMATH DE number 6851910 (Why is no real title available?) | 2018-03-21 | Paper |
| Concatenation hierarchies: new bottle, old wine | 2017-08-22 | Paper |
| Separating regular languages by locally testable and locally threshold testable languages | 2017-02-21 | Paper |
| Separation and the successor relation | 2017-01-24 | Paper |
Quantifier alternation for infinite words
Lecture Notes in Computer Science | 2016-06-10 | Paper |
Separating regular languages with first-order logic
Logical Methods in Computer Science | 2016-03-11 | Paper |
Deciding definability in \(\mathrm{FO}^2(<_{\mathbf{v}},<_{\mathbf{h}})\) on trees
Logical Methods in Computer Science | 2015-10-29 | Paper |
On separation by locally testable and locally threshold testable languages
Logical Methods in Computer Science | 2014-09-30 | Paper |
Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
Automata, Languages, and Programming | 2014-07-01 | Paper |
Separating regular languages by piecewise testable and unambiguous languages
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Regular languages of infinite trees that are Boolean combinations of open sets
Automata, Languages, and Programming | 2012-11-01 | Paper |
Toward model theory with data values
Automata, Languages, and Programming | 2012-11-01 | Paper |
A decidable characterization of locally testable tree languages
Logical Methods in Computer Science | 2012-04-02 | Paper |
Frame Definability for Classes of Trees in the μ-calculus
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
A Decidable Characterization of Locally Testable Tree Languages
Automata, Languages and Programming | 2009-07-14 | Paper |
Characterization of Logics over Ranked Tree Languages
Computer Science Logic | 2008-11-20 | Paper |
