| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Unambiguity in Automata Theory (Dagstuhl Seminar 21452) | Colcombet, Thomas et al. | 2022 |
| 2 | Deterministic and Game Separability for Regular Languages of Infinite Trees | Clemente, Lorenzo et al. | 2021 |
| 3 | On Guidable Index of Tree Automata | Niwiński, Damian et al. | 2021 |
| 4 | Computing Measures of Weak-MSO Definable Sets of Trees | Niwiński, Damian et al. | 2020 |
| 5 | On the Succinctness of Alternating Parity Good-For-Games Automata | Boker, Udi et al. | 2020 |
| 6 | Regular Choice Functions and Uniformisations For countable Domains | Michielini, Vincent et al. | 2020 |
| 7 | Unambiguity and uniformization problems on infinite trees | Bilkowski, Marcin et al. | 2013 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |