Radoslaw Piórkowski

According to our database, Radoslaw Piórkowski authored at least 9 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Boundedness of Cost Register Automata over the Integer Min-Plus Semiring.

Andrei Draghici, Radoslaw Piórkowski, Andrew Ryzhikov

Proceedings of the 33rd EACSL Annual Conference on Computer Science Logic, 2025

2023

Universal Quantification Makes Automatic Structures Hard to Decide.

Christoph Haase, Radoslaw Piórkowski

Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022

Determinisability of register and timed automata.

Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski

Log. Methods Comput. Sci., 2022

2020

WQO dichotomy for 3-graphs.

Slawomir Lasota, Radoslaw Piórkowski

Inf. Comput., 2020

Timed Games and Deterministic Separability.

Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Determinisability of One-Clock Timed Automata.

Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

New Pumping Technique for 2-Dimensional VASS.

Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

The "Hilbert Method" for Solving Transducer Equivalence Problems.

Adrien Boiret, Radoslaw Piórkowski, Janusz Schmude

CoRR, 2018

Reducing Transducer Equivalence to Register Automata Problems Solved by "Hilbert Method".

Adrien Boiret, Radoslaw Piórkowski, Janusz Schmude

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018