AbstractWe show that a previously proposed algorithm for the N-best trees problem can be made more efficient by changing how it arranges and explores the search space. Given an integer N and a weighted tree automaton (wta) M over the tropical semiring. the algorithm computes N trees of minimal weight with respect to M. Compared with the original algorithm. https://www.farmingtondepotgallery.com/product-category/tattoos/