Author of the publication

Weak Cost Register Automata Are Still Powerful.

, , , and . DLT, volume 11088 of Lecture Notes in Computer Science, page 83-95. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Reachability for Bounded Branching VASS., and . CONCUR, volume 140 of LIPIcs, page 28:1-28:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The complexity of soundness in workflow nets., , and . LICS, page 20:1-20:13. ACM, (2022)Dynamic Data Structures for Timed Automata Acceptance., , , , and . IPEC, volume 214 of LIPIcs, page 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)When is Containment Decidable for Probabilistic Automata?., , , , , and . ICALP, volume 107 of LIPIcs, page 121:1-121:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Affine Extensions of Integer Vector Addition Systems with States, , , and . (2019)https://arxiv.org/abs/1909.12386.Fast Termination and Workflow Nets., , and . CAV (1), volume 13964 of Lecture Notes in Computer Science, page 132-155. Springer, (2023)Coverability in 2-VASS with One Unary Counter is in NP., , and . FoSSaCS, volume 13992 of Lecture Notes in Computer Science, page 196-217. Springer, (2023)Weak Cost Register Automata Are Still Powerful., , , and . DLT, volume 11088 of Lecture Notes in Computer Science, page 83-95. Springer, (2018)A Robust Class of Linear Recurrence Sequences., , , and . CSL, volume 152 of LIPIcs, page 9:1-9:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The reachability problem for Petri nets is not elementary., , , , and . STOC, page 24-33. ACM, (2019)