Pages that link to "Item:Q5340253"

The following pages link to Uniqueness Theorems for Periodic Functions (Q5340253):

Displaying 50 items.

• Primitive morphisms (Q293147) (← links)
• Computing minimal and maximal suffixes of a substring (Q294952) (← links)
• The new periodicity lemma revisited (Q313759) (← links)
• Random \(\mathbb{Z}^d\)-shifts of finite type (Q316999) (← links)
• The total run length of a word (Q391314) (← links)
• Lyndon words and Fibonacci numbers (Q392802) (← links)
• Linear computation of unbordered conjugate on unordered alphabet (Q393901) (← links)
• Palindromes in circular words (Q401312) (← links)
• On the maximality of languages with combined types of code properties (Q401313) (← links)
• Random subshifts of finite type (Q414282) (← links)
• The three squares lemma revisited (Q414439) (← links)
• The three-squares lemma for partial words with one hole (Q418740) (← links)
• On generating binary words palindromically (Q472173) (← links)
• On a lemma of Crochemore and Rytter (Q491147) (← links)
• Average number of occurrences of repetitions in a necklace (Q496552) (← links)
• Generalized pattern matching and periodicity under substring consistent equivalence relations (Q507402) (← links)
• An abelian periodicity lemma (Q507407) (← links)
• Tighter bounds for the sum of irreducible LCP values (Q507409) (← links)
• Minimal non-convex words (Q544886) (← links)
• Generalised fine and Wilf's theorem for arbitrary number of periods (Q557915) (← links)
• Languages under substitutions and balanced words (Q558187) (← links)
• A periodicity result of partial words with one hole (Q597324) (← links)
• Frequencies of factors of Sturmian sequences (Q671519) (← links)
• Characteristic Sturmian words are extremal for the critical factorization theorem (Q714825) (← links)
• On suffix extensions in suffix trees (Q714837) (← links)
• An extension of the Lyndon-Schützenberger result to pseudoperiodic words (Q716329) (← links)
• The extended equation of Lyndon and Schützenberger (Q730507) (← links)
• A new approach to the periodicity lemma on strings with holes (Q732016) (← links)
• On primary and secondary repetitions in words (Q764340) (← links)
• Upper bounds on distinct maximal (sub-)repetitions in compressed strings (Q832954) (← links)
• A coarse-grained multicomputer algorithm for the detection of repetitions (Q835058) (← links)
• On a special class of primitive words (Q844893) (← links)
• Alternative proof of the Lyndon-Schützenberger theorem (Q860888) (← links)
• The origins of combinatorics on words (Q872058) (← links)
• Compact and tractable automaton-based representations of time granularities (Q875518) (← links)
• On periodic properties of circular words (Q897316) (← links)
• On block pumpable languages (Q897892) (← links)
• Graph connectivity, partial words, and a theorem of Fine and Wilf (Q924728) (← links)
• Pattern matching and membership for hierarchical message sequence charts (Q927396) (← links)
• How many runs can a string contain? (Q935160) (← links)
• Periodicity and repetitions in parameterized strings (Q947077) (← links)
• Marcus contextual languages consisting of primitive words (Q947806) (← links)
• Periodicity properties on partial words (Q948072) (← links)
• Efficient on-line repetition detection (Q955034) (← links)
• Combinatorics on partial word correlations (Q986100) (← links)
• Twin-roots of words and their properties (Q1019719) (← links)
• Intersecting periodic words (Q1022587) (← links)
• On the Shyr-Yu theorem (Q1034608) (← links)
• Inventories of unavoidable languages and the word-extension conjecture (Q1129010) (← links)
• Periods in strings (Q1154284) (← links)