Equations on Partial Words

  • F. Blanchet-Sadri
  • D. Dakota Blair
  • Rebeca V. Lewis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4162)

Abstract

It is well known that some of the most basic properties of words, like the commutativity (xy = yx) and the conjugacy (xz = zy), can be expressed as solutions of word equations. An important problem is to decide whether or not a given equation on words has a solution. For instance, the equation x m y n = z p has only periodic solutions in a free monoid, that is, if x m y n = z p holds with integers m, n, p ≥2, then there exists a word w such that x, y, z are powers of w. This result, which received a lot of attention, was first proved by Lyndon and Schützenberger for free groups. In this paper, we investigate equations on partial words. Partial words are sequences over a finite alphabet that may contain a number of “do not know” symbols. When we speak about equations on partial words, we replace the notion of equality (=) with compatibility ( ↑ ). Among other equations, we solve xyyx, xzzy, and special cases of x m y n z p for integers m, n, p ≥2. ...

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berstel, J., Boasson, L.: Partial Words and a Theorem of Fine and Wilf. Theoret. Comput. Sci. 218, 135–141 (1999)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Blanchet-Sadri, F.: Primitive Partial Words. Discrete Appl. Math. 148, 195–213 (2005)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Blanchet-Sadri, F., Anavekar, A.R.: Testing Primitivity on Partial Words, http://www.uncg.edu/mat/primitive/
  4. 4.
    Blanchet-Sadri, F., Duncan, S.: Partial Words and the Critical Factorization Theorem. J. Combin. Theory Ser. A 109, 221–245 (2005), http://www.uncg.edu/mat/cft/ MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Blanchet-Sadri, F., Luhmann, D.K.: Conjugacy on Partial Words. Theoret. Comput. Sci. 289, 297–312 (2002)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Blanchet-Sadri, F., Wetzler, N.D.: Partial Words and the Critical Factorization Theorem Revisited, http://www.uncg.edu/mat/research/cft2/
  7. 7.
    Césari, Y., Vincent, M.: Une Caractérisation des Mots Périodiques. C.R. Acad. Sci. Paris 268, 1175–1177 (1978)Google Scholar
  8. 8.
    Choffrut, C., Karhumäki, J.: Combinatorics of Words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 329–438. Springer, Heidelberg (1997)Google Scholar
  9. 9.
    Chu, D.D., Town, H.S.: Another Proof on a Theorem of Lyndon and Schützenberger in a Free Monoid. Soochow J. Math. 4, 143–146 (1978)MATHMathSciNetGoogle Scholar
  10. 10.
    Harju, T., Nowotka, D.: The Equation x i = y j z k in a Free Semigroup. Semigroup Forum 68, 488–490 (2004)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Leupold, P.: Partial Words Results and Perspectives. GRLMC, Tarragona (2003)Google Scholar
  12. 12.
    Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983); Cambridge University Press, Cambridge (1997)Google Scholar
  13. 13.
    Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)MATHGoogle Scholar
  14. 14.
    Lyndon, R.C., Schützenberger, M.P.: The Equation a m = b n c p in a Free Group. Michigan Math. J. 9, 289–298 (1962)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Makanin, G.S.: The Problem of Solvability of Equations in a Free Semigroup. Math. USSR Sbornik 32, 129–198 (1977)MATHCrossRefGoogle Scholar
  16. 16.
    Markov, A.A.: The Theory of Algorithms. Trudy Mat. Inst. Steklov 42 (1954)Google Scholar
  17. 17.
    Plandowski, W.: Satisfiability of Word Equations with Constants is in NEXPTIME. In: Annual ACM Symposium on Theory of Computing, Atlanta, GA, pp. 721–725 (1999)Google Scholar
  18. 18.
    Plandowski, W.: Satisfiability of Word Equations with Constants is in PSPACE. In: 40th Annual Symposium on Foundations of Computer Science, New York, pp. 495–500 (1999)Google Scholar
  19. 19.
    Shyr, H.J., Thierrin, G.: Disjunctive Languages and Codes. In: Karpinski, M. (ed.) FCT 1977. LNCS, vol. 56, pp. 171–176. Springer, Heidelberg (1977)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • F. Blanchet-Sadri
    • 1
  • D. Dakota Blair
    • 1
  • Rebeca V. Lewis
    • 1
  1. 1.Department of Mathematical SciencesUniversity of North CarolinaGreensboroUSA

Personalised recommendations