( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Monadic Datalog and Regular Tree Pattern Queries.

, , и . MFCS (1), том 8634 из Lecture Notes in Computer Science, стр. 426-437. Springer, (2014)

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.

Filip Lebo

Adam Filip

Heinrich Filip

Filip Beck

Filip Klein

 

Другие публикации лиц с тем же именем

The complexity of soundness in workflow nets., , и . LICS, стр. 20:1-20:13. ACM, (2022)When is Containment Decidable for Probabilistic Automata?., , , , , и . ICALP, том 107 из LIPIcs, стр. 121:1-121:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Dynamic Data Structures for Timed Automata Acceptance., , , , и . IPEC, том 214 из LIPIcs, стр. 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Reachability for Bounded Branching VASS., и . CONCUR, том 140 из LIPIcs, стр. 28:1-28:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Affine Extensions of Integer Vector Addition Systems with States., , , и . Log. Methods Comput. Sci., (2021)Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems., , , и . ACM Trans. Comput. Log., 20 (3): 14:1-14:31 (2019)When are emptiness and containment decidable for probabilistic automata?, , , , , и . J. Comput. Syst. Sci., (2021)Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata., , и . CoRR, (2023)The boundedness and zero isolation problems for weighted automata over nonnegative rationals., , , , и . LICS, стр. 15:1-15:13. ACM, (2022)Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations., , и . CAV (2), том 13372 из Lecture Notes in Computer Science, стр. 468-489. Springer, (2022)