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

1 |
Emptiness of Zero Automata Is Decidable |
Bojanczyk, Mikolaj et al. |
2017 |

2 |
Optimizing Tree Decompositions in MSO |
Bojanczyk, Mikolaj et al. |
2017 |

3 |
Orbit-Finite Sets and Their Algorithms (Invited Talk) |
Bojanczyk, Mikolaj |
2017 |

4 |
Which Classes of Origin Graphs Are Generated by Transducers |
Bojanczyk, Mikolaj et al. |
2017 |

5 |
Circuits, Logic and Games (Dagstuhl Seminar 15401) |
Bojanczyk, Mikolaj et al. |
2016 |

6 |
Decidable Extensions of MSO (Invited Talk) |
Bojanczyk, Mikolaj |
2016 |

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

8 |
Thin MSO with a Probabilistic Path Quantifier |
Bojanczyk, Mikolaj |
2016 |

9 |
Nominal Computation Theory (Dagstuhl Seminar 13422) |
Bojanczyk, Mikolaj et al. |
2014 |

10 |
Regular languages of thin trees |
Bojanczyk, Mikolaj et al. |
2013 |