Author of the publication

Efficient Evaluation of Nondeterministic Automata Using Factorization Forests.

, and . ICALP (1), volume 6198 of Lecture Notes in Computer Science, page 515-526. Springer, (2010)

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

XPath evaluation in linear time., and . PODS, page 241-250. ACM, (2008)Systems of Equations Satisfied in All Commutative Finite Semigroups.. FoSSaCS, volume 4962 of Lecture Notes in Computer Science, page 261-272. Springer, (2008)Weak Alternating Timed Automata, and . Logical Methods in Computer Science, (2012)Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time.. MFCS, volume 138 of LIPIcs, page 10:1-10:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Unboundedness for Recursion Schemes: A Simpler Type System., , and . ICALP, volume 229 of LIPIcs, page 112:1-112:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Higher-Order Model Checking Step by Step.. ICALP, volume 198 of LIPIcs, page 140:1-140:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On the Expressive Power of Higher-Order Pushdown Systems.. Log. Methods Comput. Sci., (2020)Models of Lambda-Calculus and the Weak MSO Logic., and . CSL, volume 62 of LIPIcs, page 11:1-11:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)First-Order Logic on CPDA Graphs.. CSR, volume 8476 of Lecture Notes in Computer Science, page 300-313. Springer, (2014)XPath evaluation in linear time., and . J. ACM, 58 (4): 17:1-17:33 (2011)