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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI