Author of the publication

Languages Given by Finite Automata over the Unary Alphabet.

, , , , , , , and . FSTTCS, volume 284 of LIPIcs, page 22:1-22:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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

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)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)Monadic Second Order Logic with Measure and Category Quantifiers., , and . CoRR, (2017)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)Connecting Decidability and Complexity for MSO Logic.. DLT, volume 10396 of Lecture Notes in Computer Science, page 75-79. Springer, (2017)The Topological Complexity of MSO+U and Related Automata Models., and . Fundam. Informaticae, 119 (1): 87-111 (2012)On the Strength of Unambiguous Tree Automata., and . Int. J. Found. Comput. Sci., 29 (5): 911-933 (2018)Index Problems for Game Automata., , and . ACM Trans. Comput. Log., 17 (4): 24 (2016)On Succinctness and Recognisability of Alternating Good-for-Games Automata., , , and . CoRR, (2020)