( en | de | ru )

 

Disambiguation of "Mazowiecki, Filip"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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.

Heinrich Filip

Adam Filip

Filip Lebo

Filip Beck

Filip Floegel

 

Other publications of authors with the same name

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)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)Reachability for Bounded Branching VASS., and . CONCUR, volume 140 of LIPIcs, page 28:1-28:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems., , , and . ACM Trans. Comput. Log., 20 (3): 14:1-14:31 (2019)When are emptiness and containment decidable for probabilistic automata?, , , , , and . J. Comput. Syst. Sci., (2021)Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata., , and . CoRR, (2023)Affine Extensions of Integer Vector Addition Systems with States., , , and . Log. Methods Comput. Sci., (2021)The boundedness and zero isolation problems for weighted automata over nonnegative rationals., , , , and . LICS, page 15:1-15:13. ACM, (2022)Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations., , and . CAV (2), volume 13372 of Lecture Notes in Computer Science, page 468-489. Springer, (2022)