Testing primitivity on partial words

primitive words. or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language theory, coding theory, and combinatorics on words. Testing whether or not a word is primitive can be done in linear time in the length of the word. Indeed, a word is primitive if and only if it is not an inside factor of its square. In this paper, we describe a linear time algorithm to test primitivity on partial words which are strings that may contain a number of "do not know" symbols. Our algorithm is based on the combinatorial result that under some condition, a partial word is primitive if and only if it is not compatible with an inside factor of its square. The concept of Special, related to commutativity on partial words, is foundational in the design of our algorithm. A World Wide Web server interface at http: //www.uncg.edu/mat/primitive/ has been established for automated use of the program. (c) 2006 Elsevier B.V. All rights reserved.