| Publication | Date of Publication | Type |
|---|
| Learning deterministic visibly pushdown automata under accessible stack | 2024-08-06 | Paper |
| Deterministic weighted automata under partial observability | 2024-05-29 | Paper |
Approximate learning of limit-average automata
(available as arXiv preprint) | 2023-02-03 | Paper |
Learning infinite-word automata with loop-index queries
Artificial Intelligence | 2022-04-11 | Paper |
``Most of leads to undecidability: failure of adding frequencies to LTL
(available as arXiv preprint) | 2021-10-18 | Paper |
scientific article; zbMATH DE number 7407799 (Why is no real title available?)
(available as arXiv preprint) | 2021-10-08 | Paper |
| scientific article; zbMATH DE number 7407799 (Why is no real title available?) | 2021-10-08 | Paper |
| Non-deterministic Weighted Automata on Random Words | 2021-08-04 | Paper |
| Learning deterministic automata on infinite words | 2021-07-06 | Paper |
| Satisfiability vs. finite satisfiability in elementary modal logics | 2021-04-27 | Paper |
Satisfiability vs. finite satisfiability in elementary modal logics
(available as arXiv preprint) | 2021-04-27 | Paper |
Querying best paths in graph databases
(available as arXiv preprint) | 2020-11-25 | Paper |
Average stack cost of Büchi pushdown automata
(available as arXiv preprint) | 2020-11-25 | Paper |
Non-deterministic weighted automata evaluated over Markov chains
Journal of Computer and System Sciences | 2019-11-29 | Paper |
Satisfiability versus Finite Satisfiability in Elementary Modal Logics
Fundamenta Informaticae | 2019-01-17 | Paper |
| Decidability of model checking multi-agent systems against a class of EHS specifications | 2017-07-18 | Paper |
On the decidability of elementary modal logics
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Two-variable first-order logic with equivalence closure
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Decidable elementary modal logics
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
| Elementary modal logics over transitive structures | 2017-02-02 | Paper |
Two-variable first-order logic with equivalence closure
SIAM Journal on Computing | 2014-09-18 | Paper |
| scientific article; zbMATH DE number 6302919 (Why is no real title available?) | 2014-06-11 | Paper |
The undecidability of the logic of subintervals
Fundamenta Informaticae | 2014-05-12 | Paper |
| Two-variable universal logic with transitive closure | 2012-11-22 | Paper |
| Modal logics definable by universal three-variable formulas | 2012-08-31 | Paper |
B and D are enough to make the Halpern-Shoham logic undecidable
Automata, Languages and Programming | 2010-09-07 | Paper |
Decidability of the Guarded Fragment with the Transitive Closure
Automata, Languages and Programming | 2009-07-14 | Paper |
