Document Open Access Logo

On the Parameterised Complexity of String Morphism Problems

Authors Henning Fernau, Markus L. Schmid, Yngve Villanger

PDF

File

Thumbnail PDF
PDF
LIPIcs.FSTTCS.2013.55.pdf
  • Filesize: 0.52 MB
  • 12 pages

Document Identifiers

Subject Classification

Keywords
  • String Problems
  • String Morphisms
  • Parameterised Complexity
  • Exponential Time Hypothesis
  • Pattern Languages

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Given a source string u and a target string w, to decide whether w can be obtained by applying a string morphism on u (i. e., uniformly 
replacing the symbols in u by strings) constitutes an NP-complete 
problem. For example, the target string w := baaba can be obtained from the source string u := aba, by replacing a and b in u by the strings ba and a, respectively. In this paper, we contribute to the recently started investigation of the computational complexity of the string morphism problem by studying it in the framework of parameterised complexity.

Cite As Get BibTex

Henning Fernau, Markus L. Schmid, and Yngve Villanger. On the Parameterised Complexity of String Morphism Problems. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 55-66, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013) https://doi.org/10.4230/LIPIcs.FSTTCS.2013.55

Author Details

Henning Fernau
Markus L. Schmid
Yngve Villanger
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact