| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Regular languages of thin trees | Bojanczyk, Mikolaj et al. | 2013 |
| 2 | Decidable classes of documents for XPath | Bárány, Vince et al. | 2012 |
| 3 | Imperative Programming in Sets with Atoms | Bojanczyk, Mikolaj et al. | 2012 |
| 4 | Weak MSO+U over infinite trees | Bojanczyk, Mikolaj et al. | 2012 |
| 5 | Data Monoids | Bojanczyk, Mikolaj | 2011 |
| 6 | Automata for Data Words and Data Trees | Bojanczyk, Mikolaj | 2010 |
| 7 | Beyond omega-Regular Languages | Bojanczyk, Mikolaj | 2010 |
| 8 | Deterministic Automata and Extensions of Weak MSO | Bojanczyk, Mikolaj et al. | 2009 |
| 9 | Weak MSO with the Unbounding Quantifier | Bojanczyk, Mikolaj | 2009 |
| Number of result pages: | 1 |
| Number of documents: | 9 |
