( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Generalised Twinning Property for Minimisation of Cost Register Automata.

, , и . LICS, стр. 857-866. ACM, (2016)

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.

Pierre-Alain Avouac

Pierre-Alain Dupont

Pierre-Alain Weiß

Pierre-Alain Loizeau

Pierre-Alain Mariaux

 

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

Visibly Pushdown Transducers with Well-Nested Outputs., и . Int. J. Found. Comput. Sci., 27 (2): 235-258 (2016)On Characteristic Formulae for Event-Recording Automata., и . FICS, стр. 70-78. Institute of Cybernetics, (2009)Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning., и . Petri Nets, том 6709 из Lecture Notes in Computer Science, стр. 69-88. Springer, (2011)Extended Timed Automata and Time Petri Nets., , и . ACSD, стр. 91-100. IEEE Computer Society, (2006)Synthesis of Data Word Transducers., , и . CONCUR, том 140 из LIPIcs, стр. 24:1-24:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Playing Stochastically in Weighted Timed Games to Emulate Memory., , и . ICALP, том 198 из LIPIcs, стр. 137:1-137:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A Robust Class of Languages of 2-Nested Words., , и . MFCS, том 241 из LIPIcs, стр. 50:1-50:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Robust Analysis of Timed Automata via Channel Machines., , и . FoSSaCS, том 4962 из Lecture Notes in Computer Science, стр. 157-171. Springer, (2008)Trimming Visibly Pushdown Automata., , и . CIAA, том 7982 из Lecture Notes in Computer Science, стр. 84-96. Springer, (2013)Quantitative Robustness Analysis of Flat Timed Automata., и . FoSSaCS, том 6604 из Lecture Notes in Computer Science, стр. 229-244. Springer, (2011)