Author of the publication

Tightening the Complexity of Equivalence Problems for Commutative Grammars.

, and . STACS, volume 47 of LIPIcs, page 41:1-41:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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

Shortest paths in one-counter systems., , , , and . CoRR, (2015)Reachability Problem for Weak Multi-Pushdown Automata., , and . CONCUR, volume 7454 of Lecture Notes in Computer Science, page 53-68. Springer, (2012)Timed Basic Parallel Processes., , and . CONCUR, volume 140 of LIPIcs, page 15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Shortest paths in one-counter systems., , , , and . Logical Methods in Computer Science, (2019)Reachability Problem for Weak Multi-Pushdown Automata., , and . Logical Methods in Computer Science, (2013)The complexity of regular abstractions of one-counter languages., , , , , and . LICS, page 207-216. ACM, (2016)Unboundedness Problems for Languages of Vector Addition Systems., , and . ICALP, volume 107 of LIPIcs, page 119:1-119:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Separability by Short Subsequences and Subwords., and . ICDT, volume 31 of LIPIcs, page 230-246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Complexity of regular abstractions of one-counter languages., , , , , and . CoRR, (2016)Continuous Reachability for Unordered Data Petri Nets is in PTime., , , and . FoSSaCS, volume 11425 of Lecture Notes in Computer Science, page 260-276. Springer, (2019)