umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On the complexity of variants of the k Best strings problem
Umeå University, Faculty of Science and Technology, Department of Computing Science.
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2010 (English)In: Proceedings of the Prague stringology conference 2010, dblp , 2010, 76-88 p.Conference paper, Published paper (Refereed)
Abstract [en]

We investigate the problem of extracting the k best strings from a nondeterministic weighted automaton over a semiring S. This problem, which has been considered earlier in the literature, is more difficult than extracting the k best runs, since distinct runs may not correspond to distinct strings. Unsurprisingly, the computational complexity of the problem depends on the semiring S used. We study three different cases, namely the tropical and complex tropical semirings, and the semiring of positive real numbers. For the first case, we establish a polynomial algorithm. For the second and third cases, NP-completeness and undecidability results are shown.

Place, publisher, year, edition, pages
dblp , 2010. 76-88 p.
National Category
Engineering and Technology Algebra and Logic
Identifiers
URN: urn:nbn:se:umu:diva-109058ISI: 000325018000007ISBN: 978-80-01-04597-8 (print)OAI: oai:DiVA.org:umu-109058DiVA: diva2:854926
Conference
Prague Stringology Conference (PSC), AUG 30-SEP 01, 2010, Czech Tech Univ, Dept Theoret Comp Sci, Prague, CZECH REPUBLIC
Available from: 2015-09-18 Created: 2015-09-17 Last updated: 2015-09-18Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Berglund, MartinDrewes, Frank
By organisation
Department of Computing Science
Engineering and TechnologyAlgebra and Logic

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 50 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf