Primitive partial words

Authors:
F. Blanchet-Sadri
Affiliations:
Department of Mathematical Sciences, University of North Carolina, P.O. Box 26170, Greensboro, NC 27402-6170, USA
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 9
Cited 4

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

How Many Holes Can an Unbordered Partial Word Contain?

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Two element unavoidable sets of partial words

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Combinatorial queries and updates on partial words

FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Equations on partial words

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.04

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.