Partial words and a theorem of Fine and Wilf revisited

From MaRDI portal
Publication:5958314

DOI10.1016/S0304-3975(00)00407-2zbMath0988.68142WikidataQ126550511 ScholiaQ126550511MaRDI QIDQ5958314

Robert A. Hegstrom, Francine Blanchet-Sadri

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)




Related Items (31)

Combinatorial properties of Fibonacci partial words and arraysLocal periods and binary partial words: an algorithmTesting primitivity on partial wordsA periodicity result of partial words with one holeString Periods in the Order-Preserving ModelBorder correlations, lattices, and the subgraph component polynomialIndeterminate string inference algorithmsGraph connectivity, partial words, and a theorem of Fine and WilfPeriodicity on partial wordsPartial words and the critical factorization theorem revisitedEquations on partial wordsIndeterminate strings, prefix arrays \& undirected graphsStreaming pattern matching with \(d\) wildcardsRelational codes of wordsFreeness of partial wordsRelations on wordsPeriodicity properties on partial wordsDefect theorems with compatibility relations.Primitive partial wordsCompatibility and conjugacy on partial arraysCodes, orderings, and partial wordsPartial words and the critical factorization theoremGeneralised fine and Wilf's theorem for arbitrary number of periodsCombinatorics on partial word correlationsSquare-Free Partial Words with Many WildcardsA new approach to the periodicity lemma on strings with holesString periods in the order-preserving modelThe theorem of Fine and Wilf for relational periodsTernary Square-Free Partial Words with Many WildcardsConjugacy on partial words.A periodicity lemma for partial words



Cites Work


This page was built for publication: Partial words and a theorem of Fine and Wilf revisited