On the Solvability Problem for Restricted Classes of Word Equations

Conference paper

DOI: 10.1007/978-3-662-53132-7_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9840)
Cite this paper as:
Manea F., Nowotka D., Schmid M.L. (2016) On the Solvability Problem for Restricted Classes of Word Equations. In: Brlek S., Reutenauer C. (eds) Developments in Language Theory. DLT 2016. Lecture Notes in Computer Science, vol 9840. Springer, Berlin, Heidelberg

Abstract

We investigate the complexity of the solvability problem for restricted classes of word equations with and without regular constraints. For general word equations, the solvability problem remains \({{\mathrm{\mathsf {NP}}}}\)-hard, even if the variables on both sides are ordered, and for word equations with regular constraints, the solvability problems remains \({{\mathrm{\mathsf {NP}}}}\)-hard for variable disjoint (i. e., the two sides share no variables) equations with two variables, only one of which is repeated. On the other hand, word equations with only one repeated variable (but an arbitrary number of variables) and at least one non-repeated variable on each side, can be solved in polynomial-time.

Keywords

Word equations Regular constraints NP-hardness 

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.Department of Computer ScienceKiel UniversityKielGermany
  2. 2.Fachbereich IV – Abteilung InformatikwissenschaftenTrier UniversityTrierGermany

Personalised recommendations