Author of the publication

Deciding the Borel Complexity of Regular Tree Languages.

, and . CiE, volume 8493 of Lecture Notes in Computer Science, page 163-172. Springer, (2014)

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

Containment for Conditional Tree Patterns., , , and . Logical Methods in Computer Science, (2015)The Power of the Weak., , , and . ACM Trans. Comput. Log., 21 (2): 15:1-15:47 (2020)Definable Operations On Weakly Recognizable Sets of Trees., , and . FSTTCS, volume 13 of LIPIcs, page 363-374. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Quantum Indistinguishability through Exchangeable Desirable Gambles., , and . ISIPTA, volume 147 of Proceedings of Machine Learning Research, page 22-31. PMLR, (2021)Closure operators, classifiers and desirability., , and . ISIPTA, volume 215 of Proceedings of Machine Learning Research, page 25-36. PMLR, (2023)On the Weak Index Problem for Game Automata., , and . WoLLIC, volume 9160 of Lecture Notes in Computer Science, page 93-108. Springer, (2015)Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata., , and . CSL, volume 5771 of Lecture Notes in Computer Science, page 225-239. Springer, (2009)Machine Learning Explanations by Surrogate Causal Models (MaLESCaMo)., , and . xAI (Late-breaking Work, Demos, Doctoral Consortium), volume 3554 of CEUR Workshop Proceedings, page 59-64. CEUR-WS.org, (2023)The Wadge Hierarchy of Max-Regular Languages., , , and . FSTTCS, volume 4 of LIPIcs, page 121-132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2009)Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata., , and . LICS, page 499-508. IEEE Computer Society, (2013)