000			00572nam a2200181Ia 4500
999			_c20307 _d20307
008			161214s9999 xx 000 0 und d
020			_a9781420060928 _c(hbk)
082			_a005.1 _bBLA
100			_aBlanchet-Sadri, Francine
245		0	_aAlgorithmic combinatorics on partial words
260			_aBoca Raton: _bChapman & Hall/CRC, _c2008
300			_a385 p.; _bill.: _c24 cm.
365			_aINR _b4743.58
490			_aDiscrete mathematics and its applications
520			_aThis five-part book begins with a section on basics that covers terminology, the compatibility of partial words, and combinatorial properties of words. The book then focuses on three important concepts of periodicity on partial words: period, weak period, and local period. The next part describes a linear time algorithm to test primitivity on partial words and extends the results on unbordered words to unbordered partial words, while the following section introduces some important properties of pcodes, details a variety of ways of defining and analyzing pcodes, and shows that the pcode property is decidable using two different techniques. In the final part, the author solves various equations on partial words, presents binary and ternary correlations, and covers unavoidable sets of partial words
650			_aCombinatorial analysis
650			_aComputer algorithms
650			_aComputer science - Mathematics
650			_aWilf's theorem
650			_aCritical factorization theorem
650			_aCoding
942			_2ddc _cBK