| No. |
Title |
Author |
Year |
| 1 |
On Rational Recursive Sequences |
Clemente, Lorenzo et al. |
2023 |
| 2 |
Dynamic Data Structures for Timed Automata Acceptance |
Grez, Alejandro et al. |
2021 |
| 3 |
A Robust Class of Linear Recurrence Sequences |
Barloy, Corentin et al. |
2020 |
| 4 |
On Polynomial Recursive Sequences |
Cadilhac, Michaël et al. |
2020 |
| 5 |
Reachability in Fixed Dimension Vector Addition Systems with States |
Czerwiński, Wojciech et al. |
2020 |
| 6 |
Reachability for Bounded Branching VASS |
Mazowiecki, Filip et al. |
2019 |
| 7 |
Affine Extensions of Integer Vector Addition Systems with States |
Blondin, Michael et al. |
2018 |
| 8 |
Pumping Lemmas for Weighted Automata |
Mazowiecki, Filip et al. |
2018 |
| 9 |
When is Containment Decidable for Probabilistic Automata? |
Daviaud, Laure et al. |
2018 |
| 10 |
Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One |
Figueira, Diego et al. |
2017 |
| 11 |
Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties |
Mazowiecki, Filip et al. |
2016 |
| 12 |
Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata |
Mazowiecki, Filip et al. |
2015 |
