( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Chain-Monadic Second Order Logic over Regular Automatic Trees and Epistemic Planning Synthesis.

, , и . Advances in Modal Logic, стр. 237-256. College Publications, (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.

Gaëtan Benoit

Gaëtan Rey

Gaëtan Parseihian

Gaëtan Rimmelé

Gaëtan Lassere

 

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

Deterministic Regular Functions of Infinite Words., , , и . ICALP, том 261 из LIPIcs, стр. 121:1-121:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Comparing the power of advice strings: a notion of complexity for infinite words.. CoRR, (2018)Hiding Pebbles When the Output Alphabet Is Unary.. ICALP, том 229 из LIPIcs, стр. 120:1-120:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Chain-Monadic Second Order Logic over Regular Automatic Trees and Epistemic Planning Synthesis., , и . Advances in Modal Logic, стр. 237-256. College Publications, (2018)On the Complexity of Infinite Advice Strings.. ICALP, том 107 из LIPIcs, стр. 122:1-122:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Hiding pebbles when the output alphabet is unary.. CoRR, (2021)Register Transducers Are Marble Transducers., , и . MFCS, том 170 из LIPIcs, стр. 29:1-29:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Pebble minimization: the last theorems.. CoRR, (2022)Z-polyregular functions., , и . CoRR, (2022)Pebble Transducers with Unary Output.. MFCS, том 202 из LIPIcs, стр. 40:1-40:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)