On the Parameterised Complexity of String Morphism Problems

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 𝓝 𝓟 -complete problem. We present a multivariate analysis of this problem (and its many variants) from the vi...

Full description

Saved in:

Bibliographic Details
Published in:	Theory of computing systems Vol. 59; no. 1; pp. 24 - 51
Main Authors:	Fernau, Henning, Schmid, Markus L., Villanger, Yngve
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2016 Springer Nature B.V
Subjects:	Complexity theory Computation Computer Science Hardness Mathematical analysis Multivariate analysis Pinning Strings Studies Symbols Texts Theory of Computation String problems String morphisms Exponential time hypothesis Parameterised complexity Pattern languages
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!