Skip to content Skip to footer

Research Portal of the TU Dresden

Chair of Foundations of Programming

Organisational unit: Chair

Contact

Parent units

Institute of Theoretical Computer Science

Keywords

Research Focus

Weighted Tree Automata -- May it be a little more?

Fülöp, Z. & Vogler, H., 11 Dec 2022.

Research output: Preprint/documentation/report › Preprint

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. 919, C, p. 118-143 26 p.

Research output: Contribution to journal › Research article › Contributed › peer-review

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, Cham, p. 93-105 13 p. (Lecture Notes in Computer Science, Vol. 13266).

Research output: Contribution to book/conference proceedings/anthology/report › Conference contribution › Contributed › peer-review

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