MARC record from Internet Archive

LEADER: 05131cam a2200721 a 4500
001 15071538
005 20220730230604.0
006 m o d
007 cr cnu---unuuu
008 080404s2008 flua ob 001 0 eng d
035 $a(OCoLC)ocn219670063
035 $a(NNC)15071538
040 $aN$T$beng$epn$cN$T$dYDXCP$dOCLCQ$dZCU$dOCLCQ$dE7B$dVT2$dOCLCQ$dREDDC$dOCLCQ$dTULIB$dOCLCQ$dOCLCF$dOCLCO$dOCLCQ$dIDEBK$dMNU$dUAB$dCRCPR$dOCLCQ$dNLE$dOCLCQ$dUKMGB$dWYU$dYDX$dUKAHL$dOCLCQ$dOCLCO$dOCLCQ$dSFB$dOCLCO$dOCL
015 $aGBB7C6803$2bnb
016 7 $a018428230$2Uk
019 $a311756346$a489555163$a506861780$a535494907$a614297882$a648366916$a779907106$a1048151039$a1050974930$a1065716590$a1109280771
020 $a9781420060935$q(electronic bk.)
020 $a1420060937$q(electronic bk.)
020 $a9781420060928$q(hardback ;$qalk. paper)
020 $a1420060929$q(hardback ;$qalk. paper)
035 $a(OCoLC)219670063$z(OCoLC)311756346$z(OCoLC)489555163$z(OCoLC)506861780$z(OCoLC)535494907$z(OCoLC)614297882$z(OCoLC)648366916$z(OCoLC)779907106$z(OCoLC)1048151039$z(OCoLC)1050974930$z(OCoLC)1065716590$z(OCoLC)1109280771
037 $aTANDF_184346$bIngram Content Group
050 4 $aQA76.9.A43$bB53 2008eb
072 7 $aCOM$x051390$2bisacsh
072 7 $aCOM$x051440$2bisacsh
072 7 $aCOM$x051230$2bisacsh
082 04 $a005.1$222
049 $aZCUA
100 1 $aBlanchet-Sadri, Francine.
245 10 $aAlgorithmic combinatorics on partial words /$cFrancine Blanchet-Sadri.
260 $aBoca Raton, FL :$bChapman & Hall/CRC,$c©2008.
300 $a1 online resource (385 pages) :$billustrations
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
490 1 $aDiscrete mathematics and its applications
504 $aIncludes bibliographical references (pages 369-378) and index.
588 0 $aPrint version record.
505 0 $aPreface ; Basics ; Preliminaries on Partial Words ; Alphabets, letters,
505 0 $aAnd words; Partial functions and partial words; Periodicity; Factorizations of partial words; Recursion and induction on partial words; Containment and compatibility; Combinatorial Properties of Partial Words ; Conjugacy; Commutativity; PERIODICITY ; Fine and Wilf's Theorem ; The case of zero or one hole; The case of two or three holes; Special partial words; Graphs associated with partial words; The main result; Related results; Critical Factorization Theorem ; Orderings; The zero-hole case; The main result: First version; The main result: Second version; Tests; Guibas and Odlyzko's Theorem ; The zero-hole case; The main result; The algorithm; PRIMITIVITY ; Primitive Partial Words ; Testing primitivity on partial words; Counting primitive partial words; Exact periods; First counting.
505 0 $aMethod; Second counting method; Existence of primitive partial words; Unbordered Partial Words ; Concatenations of prefixes; More results on concatenations of prefixes; Critical factorizations; Conjugates; CODING ; Pcodes of Partial Words ; Binary relations; Pcodes; Pcodes and monoids; Prefix and suffix orderings; Border ordering; Commutative ordering; Circular pcodes; Deciding the Pcode Property ; First algorithm; Second algorithm; FURTHER TOPICS ; Equations on Partial Words ; The equation x m ₁!y n ; The equation x 2 ₁!y m z ; The equation x m y n ₁!z p ; Correlations of Partial Words ; Binary and ternary correlations; Characterizations of correlations; Distributive.
505 0 $aLattices; Unavoidable Sets of Partial Words ; Unavoidable sets; Classifying unavoidable sets of size two; The case where k = 1 and l = 1; The case where k = 1 and l = 2; Larger values of k and l ; Solutions to Selected Exercises ; References ; Index ; Numerous Exercises as well as Website and Bibliographic Notes appear at the end of each chapter.
650 0 $aComputer algorithms.
650 0 $aComputer science$xMathematics.
650 0 $aCombinatorial analysis.
650 0 $aAlgorithms.
650 6 $aAlgorithmes.
650 6 $aInformatique$xMathématiques.
650 6 $aAnalyse combinatoire.
650 7 $aalgorithms.$2aat
650 7 $aCOMPUTERS$xProgramming$xOpen Source.$2bisacsh
650 7 $aCOMPUTERS$xSoftware Development & Engineering$xTools.$2bisacsh
650 7 $aCOMPUTERS$xSoftware Development & Engineering$xGeneral.$2bisacsh
650 7 $aAlgorithms.$2fast$0(OCoLC)fst00805020
650 7 $aCombinatorial analysis.$2fast$0(OCoLC)fst00868961
650 7 $aComputer algorithms.$2fast$0(OCoLC)fst00872010
650 7 $aComputer science$xMathematics.$2fast$0(OCoLC)fst00872460
655 0 $aElectronic book.
655 4 $aElectronic books.
776 08 $iPrint version:$aBlanchet-Sadri, Francine.$tAlgorithmic combinatorics on partial words.$dBoca Raton, FL : Chapman & Hall/CRC, ©2008$z9781420060928$z1420060929$w(DLC) 2007031486$w(OCoLC)148877230
830 0 $aDiscrete mathematics and its applications.
856 40 $uhttp://www.columbia.edu/cgi-bin/cul/resolve?clio15071538$zTaylor & Francis eBooks
852 8 $blweb$hEBOOKS