( en | de | ru )

 

Disambiguation of "Lehtinen, Karoliina"

Author of the publication

copydeleteadd this publication to your clipboard
A Synthesis Tool for Optimal Monitors in a Branching-Time Setting.

, , , , and . COORDINATION, volume 13271 of Lecture Notes in Computer Science, page 181-199. Springer, (2022)

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.

Karoliina Pelttari

Riia Karoliina Junnila

Emma Karoliina Seppälä

 

Other publications of authors with the same name

A modal μ perspective on solving parity games in quasi-polynomial time.. LICS, page 639-648. ACM, (2018)Improving the complexity of Parys' recursive algorithm., , and . CoRR, (2019)∑μ2 is decidable for ∏μ2., and . CiE, volume 10307 of Lecture Notes in Computer Science, page 292-303. Springer, (2017)History-Deterministic Timed Automata., , and . CONCUR, volume 243 of LIPIcs, page 14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Alternating Weak Automata from Universal Trees., , and . CONCUR, volume 140 of LIPIcs, page 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Mostowski Index via extended register games., and . CoRR, (2024)Using games and universal trees to characterise the nondeterministic index of tree languages., and . CoRR, (April 2025)On the Translation of Automata to Linear Temporal Logic., , and . FoSSaCS, volume 13242 of Lecture Notes in Computer Science, page 140-160. Springer, (2022)Parikh Automata over Infinite Words., , , and . FSTTCS, volume 250 of LIPIcs, page 40:1-40:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism., , , and . TheoretiCS, (2024)