umu.sePublications
Change search
ReferencesLink to record
Permanent link

Direct link
On Computing Best Trees forWeighted Tree Automata
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Natural and Formal Languages)
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Natural and Formal Languages)ORCID iD: 0000-0001-7349-7693
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Natural and Formal Languages)
2016 (English)In: Proc. 4th Intl. Workshop on Trends in Tree Automata and Tree Transducers (TTATT 2016) / [ed] A. Maletti, 2016Conference paper (Refereed)
Abstract [en]

We propose an algorithm for computing the $N$ best roots of a weighted hypergraph, in which the weight function is given over an idempotent and multiplicatively monotone semiring. We give a set of conditions that ensures that the weight function is well-defined and that solutions exist. Under these conditions, we prove that the proposed algorithm is correct.  This generalizes a previous result for weighted tree automata, and in doing so, broadens the practical applications.

Place, publisher, year, edition, pages
2016.
National Category
Computer Science
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:umu:diva-122474OAI: oai:DiVA.org:umu-122474DiVA: diva2:939172
Conference
Workshop on Trends in Tree Automata and Tree Transducers (TTATT 2016)
Available from: 2016-06-17 Created: 2016-06-17 Last updated: 2016-08-31

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Björklund, JohannaDrewes, FrankJonsson, Anna
By organisation
Department of Computing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 50 hits
ReferencesLink to record
Permanent link

Direct link