Author of the publication

Reachability Problems in Nondeterministic Polynomial Maps on the Integers.

, , and . DLT, volume 11088 of Lecture Notes in Computer Science, page 465-477. 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

On decidability and complexity of low-dimensional robot games., , and . J. Comput. Syst. Sci., (2020)Reachability Problem for Polynomial Iteration Is PSPACE-complete.. RP, volume 10506 of Lecture Notes in Computer Science, page 132-143. Springer, (2017)Robot Games with States in Dimension One.. RP, volume 9899 of Lecture Notes in Computer Science, page 163-176. Springer, (2016)Monadic Decomposability of Regular Relations., , , , and . ICALP, volume 132 of LIPIcs, page 103:1-103:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Integer Weighted Automata on Infinite Words., , , and . DLT, volume 12811 of Lecture Notes in Computer Science, page 167-179. Springer, (2021)On Undecidability of Counter Reachability Games in Dimension One., , and . CoRR, (2014)Weighted Automata on Infinite Words in the Context of Attacker-Defender Games., , , and . CiE, volume 9136 of Lecture Notes in Computer Science, page 206-215. Springer, (2015)Reachability Problems in Nondeterministic Polynomial Maps on the Integers., , and . DLT, volume 11088 of Lecture Notes in Computer Science, page 465-477. Springer, (2018)Small Semi-Thue System Universal with Respect to the Termination Problem., , and . Fundam. Informaticae, 154 (1-4): 177-184 (2017)Weighted automata on infinite words in the context of Attacker-Defender games., , , and . Inf. Comput., (2017)