Author of the publication

Determinizing Discounted-Sum Automata.

, and . CSL, volume 12 of LIPIcs, page 82-96. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)

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

Comparing Computational Power, and . (October 2005)Co-Büching Them All., and . FoSSaCS, volume 6604 of Lecture Notes in Computer Science, page 184-198. Springer, (2011)On the Comparison of Discounted-Sum Automata with Multiple Discount Factors., and . FoSSaCS, volume 13992 of Lecture Notes in Computer Science, page 371-391. Springer, (2023)On Succinctness and Recognisability of Alternating Good-for-Games Automata., , , and . CoRR, (2020)When a Little Nondeterminism Goes a Long Way: An Introduction to History-Determinism., and . ACM SIGLOG News, 10 (1): 24-51 (January 2023)Quantitative vs. Weighted Automata.. RP, volume 13035 of Lecture Notes in Computer Science, page 3-18. Springer, (2021)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)History-Determinism vs Fair Simulation., , , and . CONCUR, volume 311 of LIPIcs, page 12:1-12:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Automaton-Based Criteria for Membership in CTL., and . LICS, page 155-164. ACM, (2018)On the Translation of Automata to Linear Temporal Logic., , and . FoSSaCS, volume 13242 of Lecture Notes in Computer Science, page 140-160. Springer, (2022)