Author of the publication

Synthesis from Weighted Specifications with Partial Domains over Finite Words.

, , and . FSTTCS, volume 182 of LIPIcs, page 46:1-46:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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

Decision Problems for Deterministic Pushdown Automata on Infinite Words.. AFL, volume 151 of EPTCS, page 55-73. (2014)On Finitely Ambiguous Büchi Automata., and . DLT, volume 11088 of Lecture Notes in Computer Science, page 503-515. Springer, (2018)Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata., and . FoSSaCS, volume 12077 of Lecture Notes in Computer Science, page 522-541. Springer, (2020)Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm., and . MFCS, volume 202 of LIPIcs, page 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem., and . CSL, volume 5213 of Lecture Notes in Computer Science, page 416-430. Springer, (2008)Regular Cost Functions over Finite Trees., and . LICS, page 70-79. IEEE Computer Society, (2010)Projection for Büchi Tree Automata with Constraints between Siblings., and . Int. J. Found. Comput. Sci., 31 (6): 749-775 (2020)Learning MSO-definable hypotheses on strings., , and . ALT, volume 76 of Proceedings of Machine Learning Research, page 434-451. PMLR, (2017)Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations., and . GandALF, volume 161 of EPTCS, page 88-101. (2014)Projection for Büchi Tree Automata with Constraints Between Siblings., and . DLT, volume 11088 of Lecture Notes in Computer Science, page 478-490. Springer, (2018)