No. |
Title |
Author |
Year |
---|

1 |
Homogeneity Without Loss of Generality |
Parys, Pawel |
2018 |

2 |
Recursion Schemes and the WMSO+U Logic |
Parys, Pawel |
2018 |

3 |
The Complexity of the Diagonal Problem for Recursion Schemes |
Parys, Pawel |
2018 |

4 |
Models of Lambda-Calculus and the Weak MSO Logic |
Parys, Pawel et al. |
2016 |

5 |
On a Fragment of AMSO and Tiling Systems |
Blumensath, Achim et al. |
2016 |

6 |
Reasoning About Integrity Constraints for Tree-Structured Data |
Czerwinski, Wojciech et al. |
2016 |

7 |
The MSO+U Theory of (N,<) Is Undecidable |
Bojanczyk, Mikolaj et al. |
2016 |

8 |
Ordered Tree-Pushdown Systems |
Clemente, Lorenzo et al. |
2015 |

9 |
A Pumping Lemma for Pushdown Graphs of Any Level |
Parys, Pawel |
2012 |

10 |
Decidable classes of documents for XPath |
Bárány, Vince et al. |
2012 |