Testing primitivity on partial words
type: Item
instance of: scholarly article
title: Testing primitivity on partial words
zbMATH Open document ID: 1108.68093
author: F. Blanchet-Sadri
author: Arundhati R. Anavekar
published in: Discrete Applied Mathematics
publication date: 2007-03-02T00:00:00Z
full work available at URL: F Blanchet-Sadri Testing 2007.pdf
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 5130468
zbMATH Keywords: combinatorics on words
zbMATH Keywords: words
zbMATH Keywords: partial words
zbMATH Keywords: primitive words
zbMATH Keywords: primitive partial words
zbMATH Keywords: special partial words
zbMATH Keywords: compatibility
zbMATH Keywords: algorithm
MaRDI profile type: Publication
OpenAlex ID: W2098619497
cites work: Partial words and a theorem of Fine and Wilf
cites work: Periodicity on partial words
cites work: Codes, orderings, and partial words
cites work: Primitive partial words
cites work: Local periods and binary partial words: an algorithm
cites work: Partial words and the critical factorization theorem
cites work: Partial words and a theorem of Fine and Wilf revisited
cites work: Conjugacy on partial words.
cites work: Q4714446
cites work: Q4849531
cites work: Q4954446
cites work: Periods in strings
cites work: DNA Computing
DOI: 10.1016/J.DAM.2006.07.001
description: scientific article; zbMATH DE number 5130468