| No. |
Title |
Author |
Year |
| 1 |
Involved VASS Zoo (Invited Talk) |
Czerwiński, Wojciech |
2022 |
| 2 |
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems Is Decidable |
Czerwiński, Wojciech et al. |
2022 |
| 3 |
Improved Lower Bounds for Reachability in Vector Addition Systems |
Czerwiński, Wojciech et al. |
2021 |
| 4 |
New Techniques for Universality in Unambiguous Register Automata |
Czerwiński, Wojciech et al. |
2021 |
| 5 |
Reachability in Fixed Dimension Vector Addition Systems with States |
Czerwiński, Wojciech et al. |
2020 |
| 6 |
Universality Problem for Unambiguous VASS |
Czerwiński, Wojciech et al. |
2020 |
| 7 |
Improved Bounds for the Excluded-Minor Approximation of Treedepth |
Czerwinski, Wojciech et al. |
2019 |
| 8 |
New Pumping Technique for 2-Dimensional VASS |
Czerwinski, Wojciech et al. |
2019 |
| 9 |
Regular Separability of Well-Structured Transition Systems |
Czerwinski, Wojciech et al. |
2018 |
| 10 |
Unboundedness Problems for Languages of Vector Addition Systems |
Czerwinski, Wojciech et al. |
2018 |
| 11 |
Regular Separability of Parikh Automata |
Clemente, Lorenzo et al. |
2017 |
| 12 |
Separability of Reachability Sets of Vector Addition Systems |
Clemente, Lorenzo et al. |
2017 |
| 13 |
Reasoning About Integrity Constraints for Tree-Structured Data |
Czerwinski, Wojciech et al. |
2016 |
| 14 |
Fast equivalence-checking for normed context-free processes |
Czerwinski, Wojciech et al. |
2010 |
