| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Algorithms in Automata Theory (Dagstuhl Seminar 9406) | Arnold, André et al. | 2021 |
| 2 | Applications of Tree Automata in Rewriting, Logic and Programming (Dagstuhl Seminar 9743) | Comon, Hubert et al. | 2021 |
| 3 | When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic? | Maneth, Sebastian et al. | 2020 |
| 4 | Computing the Longest Common Prefix of a Context-free Language in Polynomial Time | Luttenberger, Michael et al. | 2018 |
| 5 | Formal Methods of Transformations (Dagstuhl Seminar 17142) | Filiot, Emmanuel et al. | 2017 |
| 6 | Tree Transducers and Formal Methods (Dagstuhl Seminar 13192) | Maneth, Sebastian et al. | 2013 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |