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

1 |
Passive Learning of Deterministic Büchi Automata by Combinations of DFAs |
Bohn, León et al. |
2022 |

2 |
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm |
Bohn, León et al. |
2021 |

3 |
State Space Reduction For Parity Automata |
Löding, Christof et al. |
2020 |

4 |
Synthesis from Weighted Specifications with Partial Domains over Finite Words |
Filiot, Emmanuel et al. |
2020 |

5 |
Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-Schupp |
Löding, Christof et al. |
2019 |

6 |
New Pumping Technique for 2-Dimensional VASS |
Czerwinski, Wojciech et al. |
2019 |

7 |
Tree Automata with Global Constraints for Infinite Trees |
Landwehr, Patrick et al. |
2019 |

8 |
On Equivalence and Uniformisation Problems for Finite Transducers |
Filiot, Emmanuel et al. |
2016 |

9 |
Transformation Between Regular Expressions and omega-Automata |
Löding, Christof et al. |
2016 |

10 |
Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers |
Löding, Christof et al. |
2016 |

11 |
A Unified Approach to Boundedness Properties in MSO |
Kaiser, Lukasz et al. |
2015 |

12 |
Decidability Results on the Existence of Lookahead Delegators for NFA |
Löding, Christof et al. |
2013 |

13 |
Deciding the weak definability of Büchi definable tree languages |
Colcombet, Thomas et al. |
2013 |

14 |
Degrees of Lookahead in Context-free Infinite Games |
Fridman, Wladimir et al. |
2011 |

15 |
On Nondeterministic Unranked Tree Automata with Sibling Constraints |
Löding, Christof et al. |
2009 |

16 |
Deterministic Automata on Unranked Trees |
Thomas, Wolfgang et al. |
2005 |