Primitive partial words

Authors:
F. Blanchet-Sadri
Affiliations:
Department of Mathematical Sciences, University of North Carolina, Greensboro, NC
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 9
Cited 5

Text algorithms

Text algorithms
Combinatorics of words

Handbook of formal languages, vol. 1
Partial words and a theorem of Fine and Wilf

Theoretical Computer Science
Periods and binary words

Journal of Combinatorial Theory Series A
Partial words and a theorem of Fine and Wilf revisited

Theoretical Computer Science
Conjugacy on partial words

Theoretical Computer Science
Local periods and binary partial words: an algorithm

Theoretical Computer Science
Partial words and the critical factorization theorem

Journal of Combinatorial Theory Series A
Codes, orderings, and partial words

Theoretical Computer Science

Testing primitivity on partial words

Discrete Applied Mathematics
Freeness of partial words

Theoretical Computer Science
Relational codes of words

Theoretical Computer Science
Periodicity properties on partial words

Information and Computation
Unbordered partial words

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

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.