Testing primitivity on partial words

DOI10.1016/j.dam.2006.07.001zbMath1108.68093OpenAlexW2098619497MaRDI QIDQ868383

Francine Blanchet-Sadri, Arundhati R. Anavekar

Publication date: 2 March 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://libres.uncg.edu/ir/uncg/f/F_Blanchet-Sadri_Testing_2007.pdf

zbMATH Keywords

wordsalgorithmcompatibilitycombinatorics on wordsprimitive wordspartial wordsprimitive partial wordsspecial partial words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (5)

Abelian-primitive partial words ⋮ The three-squares lemma for partial words with one hole ⋮ An algorithmic toolbox for periodic partial words ⋮ Equations on partial words ⋮ Periodicity properties on partial words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Codes, orderings, and partial words
• Periods in strings
• Partial words and a theorem of Fine and Wilf
• Periodicity on partial words
• Partial words and the critical factorization theorem
• Conjugacy on partial words.
• Local periods and binary partial words: an algorithm
• Primitive partial words
• DNA Computing
• Partial words and a theorem of Fine and Wilf revisited

This page was built for publication: Testing primitivity on partial words