We generalise a search algorithm by Mohri and Riley from strings to trees. The original algorithm takes as input a weighted automaton M over the tropical semiring, together with an integer N, and outputs N strings of minimal weight with respect to M. In our setting, M defines a weighted tree language, again over the tropical semiring, and the output is a set of N trees with minimal weight. We prove that the algorithm is correct, and that its time complexity is a low polynomial in N and the relevant size parameters of M.
CITATION STYLE
Björklund, J., Drewes, F., & Zechner, N. (2015). An efficient best-trees algorithm for weighted tree automata over the tropical semiring. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8977, pp. 97–108). Springer Verlag. https://doi.org/10.1007/978-3-319-15579-1_7
Mendeley helps you to discover research relevant for your work.