List of Theses
For advanced search options you can also view this in the Forschungsinformationssystem of the TU Dresden.
The Problem of Computing the Most Probable Tree of a Probabilistic Tree Automaton
Art der Abschlussarbeit
Master
Autoren
- Meinert, Pius
Betreuer
- Dipl.-Inf. Kilian Gebhardt
Schlagwörter
weighted tree automata; most probable tree; np-hard
Berichtsjahr
2019
Last modified: 2020-10-26 10:29am