An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring
From MaRDI portal
Publication:2799165
DOI10.1007/978-3-319-15579-1_7zbMath1423.68244OpenAlexW51626398MaRDI QIDQ2799165
Johanna Björklund, Niklas Zechner, Frank Drewes
Publication date: 8 April 2016
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-15579-1_7
Related Items (6)
Finding the \(N\) best vertices in an infinite weighted hypergraph ⋮ Efficient enumeration of weighted tree languages over the tropical semiring ⋮ Unnamed Item ⋮ Bottom-up unranked tree-to-graph transducers for translation into semantic graphs ⋮ An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring ⋮ Finite sequentiality of unambiguous max-plus tree automata
Cites Work
This page was built for publication: An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring