Author of the publication

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)

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)The Topological Complexity of MSO+U and Related Automata Models., and . Fundam. Informaticae, 119 (1): 87-111 (2012)Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones. GandALF, volume 96 of EPTCS, page 247-260. (2012)On Unambiguous Regular Tree Languages of Index (0, 2)., , and . CSL, volume 41 of LIPIcs, page 534-548. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)On the Borel Inseparability of Game Tree Languages., , and . STACS, volume 3 of LIPIcs, page 565-575. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)