( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Alternating Tree Automata with Qualitative Semantics.

, , , , , , , , , и . ACM Trans. Comput. Log., 22 (1): 7:1-7:24 (2021)

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.

Emmanuel Filiot

Emmanuel Dogbatse

Emmanuel Umana

Emmanuel Lule

Emmanuel Fiolitakis

 

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

Synthesizing Computable Functions from Rational Specifications Over Infinite Words., и . Int. J. Found. Comput. Sci., 35 (1&2): 179-214 (января 2024)Two-Way Parikh Automata., , и . FSTTCS, том 150 из LIPIcs, стр. 40:1-40:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Decidable weighted expressions with Presburger combinators., , и . J. Comput. Syst. Sci., (2019)Synthesis of Computable Regular Functions of Infinite Words., , , и . CONCUR, том 171 из LIPIcs, стр. 43:1-43:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Two-Player Boundedness Counter Games., и . CONCUR, том 243 из LIPIcs, стр. 21:1-21:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Synthesis from Weighted Specifications with Partial Domains over Finite Words., , и . FSTTCS, том 182 из LIPIcs, стр. 46:1-46:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Two-Way Parikh Automata with a Visibly Pushdown Stack., , и . FoSSaCS, том 11425 из Lecture Notes in Computer Science, стр. 189-206. Springer, (2019)Alternating Tree Automata with Qualitative Semantics., , , , , , , , , и . CoRR, (2020)Deterministic Regular Functions of Infinite Words., , , и . ICALP, том 261 из LIPIcs, стр. 121:1-121:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)The Adversarial Stackelberg Value in Quantitative Games., , и . ICALP, том 168 из LIPIcs, стр. 127:1-127:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)