| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Constraint Automata on Infinite Data Trees: from CTL(ℤ)/CTL^*(ℤ) to Decision Procedures | Demri, Stéphane et al. | 2023 |
| 2 | Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order | Peteler, Dominik et al. | 2022 |
| 3 | Unambiguity in Automata Theory (Dagstuhl Seminar 21452) | Colcombet, Thomas et al. | 2022 |
| 4 | New Techniques for Universality in Unambiguous Register Automata | Czerwiński, Wojciech et al. | 2021 |
| 5 | The Containment Problem for Unambiguous Register Automata | Mottet, Antoine et al. | 2019 |
| 6 | The Complexity of Flat Freeze LTL | Bollig, Benedikt et al. | 2017 |
| 7 | Synchronizing Data Words for Register Automata | Babari, Parvaneh et al. | 2016 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |