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

1 |
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct |
Guha, Shibashis et al. |
2021 |

2 |
A Ramsey Theorem for Finite Monoids |
Jecker, Ismaël |
2021 |

3 |
Decomposing Permutation Automata |
Jecker, Ismaël et al. |
2021 |

4 |
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes |
Arrighi, Emmanuel et al. |
2021 |

5 |
Simplified Game of Life: Algorithms and Complexity |
Chatterjee, Krishnendu et al. |
2020 |

6 |
Unary Prime Languages |
Jecker, Ismaël et al. |
2020 |

7 |
Beyond Admissibility: Dominance Between Chains of Strategies |
Basset, Nicolas et al. |
2018 |

8 |
The Complexity of Transducer Synthesis from Multi-Sequential Specifications |
Exibard, Léo et al. |
2018 |

9 |
On Reversible Transducers |
Dartois, Luc et al. |
2017 |

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