( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Decidability in the Logic of Subsequences and Supersequences.

, и . FSTTCS, том 45 из LIPIcs, стр. 84-97. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)

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.

Philippe Zysset

Philippe Dreuw

Philippe Kersting

Philippe Bopp

Philippe Moisan

 

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

On the index of Simon's congruence for piecewise testability., и . CoRR, (2013)The Height of Piecewise-Testable Languages with Applications in Logical Complexity., и . CSL, том 62 из LIPIcs, стр. 37:1-37:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Model Checking Timed Automata with One or Two Clocks., , и . CONCUR, том 3170 из Lecture Notes in Computer Science, стр. 387-401. Springer, (2004)Fundamental Structures in Well-Structured Infinite Transition Systems., и . LATIN, том 1380 из Lecture Notes in Computer Science, стр. 102-118. Springer, (1998)Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets.. MFCS, том 6281 из Lecture Notes in Computer Science, стр. 616-628. Springer, (2010)Verifying Performance Equivalence for Timed Basic Parallel Processes., , и . FoSSaCS, том 1784 из Lecture Notes in Computer Science, стр. 35-47. Springer, (2000)On flat lossy channel machines.. CoRR, (2020)On the piecewise complexity of words and periodic words., , , и . CoRR, (2023)On Reachability for Unidirectional Channel Systems Extended with Regular Tests., , и . Log. Methods Comput. Sci., (2015)An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems., и . Nord. J. Comput., 9 (1): 118-144 (2002)