( en | de | ru )

 

Disambiguation of "Lehtinen, Karoliina"

Author of the publication

copydeleteadd this publication to your clipboard
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.

, , , and . Log. Methods Comput. Sci., (2024)

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

Testing Equivalence vs. Runtime Monitoring., , , , and . Models, Languages, and Tools for Concurrent and Distributed Programming, volume 11665 of Lecture Notes in Computer Science, page 28-44. Springer, (2019)A Recursive Approach to Solving Parity Games in Quasipolynomial Time., , , and . CoRR, (2021)Good-for-games ω-Pushdown Automata., and . Log. Methods Comput. Sci., (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)On the Translation of Automata to Linear Temporal Logic., , and . FoSSaCS, volume 13242 of Lecture Notes in Computer Science, page 140-160. Springer, (2022)Deciding the First Levels of the Modal mu Alternation Hierarchy by Formula Construction., and . CSL, volume 41 of LIPIcs, page 457-471. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)The Cost of Monitoring Alone., , , , and . From Reactive Systems to Cyber-Physical Systems, volume 11500 of Lecture Notes in Computer Science, page 259-275. Springer, (2019)When a Little Nondeterminism Goes a Long Way: An Introduction to History-Determinism., and . ACM SIGLOG News, 10 (1): 24-51 (January 2023)A Recursive Approach to Solving Parity Games in Quasipolynomial Time., , , and . Log. Methods Comput. Sci., (2022)On Succinctness and Recognisability of Alternating Good-for-Games Automata., , , and . CoRR, (2020)