Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10328476 | Discrete Applied Mathematics | 2005 | 19 Pages |
Abstract
Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in formal language theory, coding theory, and combinatorics on words to name a few. In this paper, we extend some fundamental results about primitive words to primitive partial words. Partial words are strings that may have a number of “do not know” symbols.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
F. Blanchet-Sadri,