Efficient enumeration of weighted tree languages over the tropical semiring

DOI10.1016/j.jcss.2017.03.006zbMath1423.68245OpenAlexW2605300080MaRDI QIDQ2424678

Niklas Zechner, Johanna Björklund, Frank Drewes

Publication date: 25 June 2019

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2017.03.006

zbMATH Keywords

tropical semiringweighted tree automaton\(N\)-best analysis

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Formal languages and automata (68Q45)

Related Items (1)

Special issue: Selected papers of the 9th international conference on language and automata theory and applications, LATA 2015

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A generalization of Dijkstra's algorithm
• An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring
• Finding the k Shortest Paths
• Weighted Tree Automata and Tree Transducers
• Algebraic automata and context-free sets

This page was built for publication: Efficient enumeration of weighted tree languages over the tropical semiring