Author of the publication

The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable.

, , and . TLCA, volume 3461 of Lecture Notes in Computer Science, page 39-54. Springer, (2005)

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

Safety Is not a Restriction at Level 2 for String Languages., , and . FoSSaCS, volume 3441 of Lecture Notes in Computer Science, page 490-504. Springer, (2005)On the computational complexity of cut-reduction, and . CoRR, (2007)Multivariate amortized resource analysis, , and . POPL, page 357-370. ACM, (2011)A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata.. Logical Methods in Computer Science, (2007)Relativizing small complexity classes and their theories., , and . Comput. Complex., 25 (1): 177-215 (2016)Operational aspects of untyped Normalisation by Evaluation, and . Mathematical. Structures in Comp. Sci., 14 (4): 587-611 (2004)The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable., , and . TLCA, volume 3461 of Lecture Notes in Computer Science, page 39-54. Springer, (2005)On the Computational Complexity of Cut-Reduction., and . LICS, page 284-293. IEEE Computer Society, (2008)A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation., and . LICS, page 84-91. IEEE Computer Society, (2000)Normalization by Evaluation for Martin-Löf Type Theory with One Universe, , and . Proceedings of the 23rd Conference on the Mathematical Foundations of Programming Semantics (MFPS XXIII), New Orleans, LA, USA, 11-14 April 2007, page 17-39. Elsevier, (2007)