| No. |
Title |
Author |
Year |
| 1 |
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems Is Decidable |
Czerwiński, Wojciech et al. |
2022 |
| 2 |
Parametrized Universality Problems for One-Counter Nets |
Almagor, Shaull et al. |
2020 |
| 3 |
Universality Problem for Unambiguous VASS |
Czerwiński, Wojciech et al. |
2020 |
| 4 |
Timed Basic Parallel Processes |
Clemente, Lorenzo et al. |
2019 |
| 5 |
Linear Equations with Ordered Data |
Hofman, Piotr et al. |
2018 |
| 6 |
Unboundedness Problems for Languages of Vector Addition Systems |
Czerwinski, Wojciech et al. |
2018 |
| 7 |
On Büchi One-Counter Automata |
Böhm, Stanislav et al. |
2017 |
| 8 |
Tightening the Complexity of Equivalence Problems for Commutative Grammars |
Haase, Christoph et al. |
2016 |
| 9 |
Separability by Short Subsequences and Subwords |
Hofman, Piotr et al. |
2015 |
| 10 |
Simulation Over One-counter Nets is PSPACE-Complete |
Hofman, Piotr et al. |
2013 |
