Author of the publication

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

PTL-separability and closures for WQOs on words.. CoRR, (2018)The Complexity of Downward Closure Comparisons.. ICALP, volume 55 of LIPIcs, page 123:1-123:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Separability by piecewise testable languages and downward closures beyond subwords.. LICS, page 929-938. ACM, (2018)Context-Bounded Verification of Context-Free Specifications., , , , and . Proc. ACM Program. Lang., 7 (POPL): 2141-2170 (January 2023)The complexity of bidirected reachability in valence systems., , and . CoRR, (2021)The Complexity of Bidirected Reachability in Valence Systems., , and . LICS, page 26:1-26:15. ACM, (2022)Rational Subsets of Baumslag-Solitar Groups., , and . ICALP, volume 168 of LIPIcs, page 116:1-116:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond., , and . TACAS (1), volume 12651 of Lecture Notes in Computer Science, page 449-467. Springer, (2021)Computing downward closures for stacked counter automata.. CoRR, (2014)Labeled Step Sequences in Petri Nets., and . Petri Nets, volume 5062 of Lecture Notes in Computer Science, page 270-287. Springer, (2008)