Chair of Foundations of Programming
Organisational unit: Chair
1 - 10 out of 33Page size: 10
33 Research output
- 2023
- Published
Hybrid tree automata and the yield theorem for constituent tree automata.
Drewes, F., Mörbitz, R. & Vogler, H., 10 Nov 2023, In: Theoretical computer science : the journal of the EATCS. 979, 114185.Research output: Contribution to journal › Conference article › Contributed › peer-review
- Published
Constituency Parsing as an Instance of the M-monoid Parsing Problem.
Mörbitz, R., 2023, p. 79-94.Research output: Contribution to conferences › Paper › Contributed › peer-review
- 2022
Weighted Tree Automata -- May it be a little more?
Fülöp, Z. & Vogler, H., 11 Dec 2022.Research output: Preprint/documentation/report › Preprint
- Published
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids.
Droste, M., Fülöp, Z., Kószó, D. & Vogler, H., 5 Jun 2022, In: Theoretical computer science : the journal of the EATCS. 919, C, p. 118-143 26 p.Research output: Contribution to journal › Research article › Contributed › peer-review
- Published
Hybrid Tree Automata and the Yield Theorem for Constituent Tree Automata
Drewes, F., Mörbitz, R. & Vogler, H., 2022, Implementation and Application of Automata: 26th International Conference, CIAA 2022, Rouen, France, June 28 – July 1, 2022, Proceedings. Caron, P. & Mignot, L. (eds.). Springer, Berlin [u. a.], p. 93-105 13 p. (Lecture Notes in Computer Science, Volume 13266).Research output: Contribution to book/conference proceedings/anthology/report › Conference contribution › Contributed › peer-review
- 2021
- Published
Approximated Determinisation of Weighted Tree Automata
Dörband, F., Stier, K. & Feller, T., 2021, Language and Automata Theory and Applications: 15th International Conference, LATA 2021, Milan, Italy, March 1–5, 2021, Proceedings. p. 255-266 12 p.Research output: Contribution to book/conference proceedings/anthology/report › Conference contribution › Contributed › peer-review
- Published
Crisp-determinization of weighted tree automata over strong bimonoids
Fülöp, Z., Kószó, D. & Vogler, H., 2021, In: Discrete Mathematics and Theoretical Computer Science. 23, 1Research output: Contribution to journal › Research article › Contributed › peer-review
- Published
Kleene and Büchi Theorems for Weighted Forest Languages over M-Monoids
Dörband, F., 2021, In: Information and Computation. 281, 104765.Research output: Contribution to journal › Research article › Contributed › peer-review
- Published
Linear weighted tree automata with storage and inverse linear tree homomorphisms
Herrmann, L., 2021, In: Information and Computation. 281Research output: Contribution to journal › Research article › Contributed › peer-review
- Published
Sequentiality of Group-weighted Tree Automata
Dörband, F., Stier, K. & Feller, T., 2021, Language and Automata Theory and Applications: 15th International Conference, LATA 2021, Milan, Italy, March 1–5, 2021, Proceedings. Springer, Berlin [u. a.], p. 267-278 12 p. (Lecture Notes in Computer Science, Volume 12368).Research output: Contribution to book/conference proceedings/anthology/report › Conference contribution › Contributed › peer-review