Author of the publication

On Determinisation of Good-for-Games Automata.

, and . ICALP (2), volume 9135 of Lecture Notes in Computer Science, page 299-310. Springer, (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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Monadic Second Order Logic with Measure and Category Quantifiers., , and . CoRR, (2017)Connecting Decidability and Complexity for MSO Logic.. DLT, volume 10396 of Lecture Notes in Computer Science, page 75-79. Springer, (2017)On Succinctness and Recognisability of Alternating Good-for-Games Automata., , , and . CoRR, (2020)On the Complexity of Branching Games with Regular Conditions., and . MFCS, volume 58 of LIPIcs, page 78:1-78:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the Topological Complexity of MSO+U and Related Automata Models., , and . MFCS, volume 6281 of Lecture Notes in Computer Science, page 429-440. Springer, (2010)Unambiguity and uniformization problems on infinite trees., and . CSL, volume 23 of LIPIcs, page 81-100. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Uniformisation Gives the Full Strength of Regular Languages., , and . MFCS, volume 138 of LIPIcs, page 61:1-61:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the Succinctness of Alternating Parity Good-For-Games Automata., , , and . FSTTCS, volume 182 of LIPIcs, page 41:1-41:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)How Deterministic are Good-For-Games Automata?., , and . FSTTCS, volume 93 of LIPIcs, page 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)On Determinisation of Good-for-Games Automata., and . ICALP (2), volume 9135 of Lecture Notes in Computer Science, page 299-310. Springer, (2015)