Computer Science – Computational Complexity
Scientific paper
2010-02-22
Computer Science
Computational Complexity
Submitted to International Journal of Foundations of Computer Science
Scientific paper
A pseudo-primitive word with respect to an antimorphic involution \theta is a word which cannot be written as a catenation of occurrences of a strictly shorter word t and \theta(t). Properties of pseudo-primitive words are investigated in this paper. These properties link pseudo-primitive words with essential notions in combinatorics on words such as primitive words, (pseudo)-palindromes, and (pseudo)-commutativity. Their applications include an improved solution to the extended Lyndon-Sch\"utzenberger equation u_1 u_2 ... u_l = v_1 ... v_n w_1 ... w_m, where u_1, ..., u_l \in {u, \theta(u)}, v_1, ..., v_n \in {v, \theta(v)}, and w_1, ..., w_m \in {w, \theata(w)} for some words u, v, w, integers l, n, m \ge 2, and an antimorphic involution \theta. We prove that for l \ge 4, n,m \ge 3, this equation implies that u, v, w can be expressed in terms of a common word t and its image \theta(t). Moreover, several cases of this equation where l = 3 are examined.
Kari Lila
Masson Benoit
Seki Shinnosuke
No associations
LandOfFree
Properties of Pseudo-Primitive Words and their Applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Properties of Pseudo-Primitive Words and their Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Properties of Pseudo-Primitive Words and their Applications will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-373395