| No. |
Title |
Author |
Year |
| 1 |
Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix |
Michaliszyn, Jakub et al. |
2023 |
| 2 |
Learning Deterministic Visibly Pushdown Automata Under Accessible Stack |
Michaliszyn, Jakub et al. |
2022 |
| 3 |
Approximate Learning of Limit-Average Automata |
Michaliszyn, Jakub et al. |
2019 |
| 4 |
Average Stack Cost of Büchi Pushdown Automata |
Michaliszyn, Jakub et al. |
2018 |
| 5 |
Non-deterministic Weighted Automata on Random Words |
Michaliszyn, Jakub et al. |
2018 |
| 6 |
Querying Best Paths in Graph Databases |
Michaliszyn, Jakub et al. |
2018 |
| 7 |
Elementary Modal Logics over Transitive Structures |
Michaliszyn, Jakub et al. |
2013 |
| 8 |
Two-Variable Universal Logic with Transitive Closure |
Kieronski, Emanuel et al. |
2012 |
| 9 |
Modal Logics Definable by Universal Three-Variable Formulas |
Kieronski, Emanuel et al. |
2011 |
