( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Connecting Decidability and Complexity for MSO Logic.

. DLT, том 10396 из Lecture Notes in Computer Science, стр. 75-79. Springer, (2017)

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.

Jörg Skrzypczak

Jörg Skrzypczak

Leszek Skrzypczak

Ulrich Skrzypczak

Ingrid Skrzypczak

 

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

Monadic Second Order Logic with Measure and Category Quantifiers., , и . CoRR, (2017)On the Strength of Unambiguous Tree Automata., и . Int. J. Found. Comput. Sci., 29 (5): 911-933 (2018)Index Problems for Game Automata., , и . ACM Trans. Comput. Log., 17 (4): 24 (2016)The Topological Complexity of MSO+U and Related Automata Models., и . Fundam. Informaticae, 119 (1): 87-111 (2012)Connecting Decidability and Complexity for MSO Logic.. DLT, том 10396 из Lecture Notes in Computer Science, стр. 75-79. Springer, (2017)Uniformisation Gives the Full Strength of Regular Languages., , и . MFCS, том 138 из LIPIcs, стр. 61:1-61:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the Topological Complexity of MSO+U and Related Automata Models., , и . MFCS, том 6281 из Lecture Notes in Computer Science, стр. 429-440. Springer, (2010)Unambiguity and uniformization problems on infinite trees., и . CSL, том 23 из LIPIcs, стр. 81-100. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)On the Complexity of Branching Games with Regular Conditions., и . MFCS, том 58 из LIPIcs, стр. 78:1-78:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On Succinctness and Recognisability of Alternating Good-for-Games Automata., , , и . CoRR, (2020)