The following pages link to (Q4681771):
Displaying 39 items.
- On del-robust primitive words (Q277635) (← links)
- Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source (Q384993) (← links)
- Efficient seed computation revisited (Q390905) (← links)
- Enhanced string covering (Q393116) (← links)
- Suffix array and Lyndon factorization of a text (Q405567) (← links)
- A note on Sturmian words (Q418801) (← links)
- Textual data compression in computational biology: algorithmic techniques (Q465689) (← links)
- Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without forbidden words (Q466028) (← links)
- \(k\)-abelian pattern matching (Q491150) (← links)
- Indeterminate strings, prefix arrays \& undirected graphs (Q496001) (← links)
- Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049) (← links)
- Average number of occurrences of repetitions in a necklace (Q496552) (← links)
- Computing the number of cubic runs in standard Sturmian words (Q496558) (← links)
- Generalized pattern matching and periodicity under substring consistent equivalence relations (Q507402) (← links)
- 2D Lyndon words and applications (Q513297) (← links)
- Where to place a hole to achieve a maximal escape rate (Q532611) (← links)
- An extension of Christoffel duality to a subset of Sturm numbers and their characteristic words (Q544878) (← links)
- The expected profile of digital search trees (Q549244) (← links)
- A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) (Q638566) (← links)
- The index of a binary word (Q714791) (← links)
- Reactive automata (Q716325) (← links)
- On z-factorization and c-factorization of standard episturmian words (Q719264) (← links)
- Grasshopper avoidance of patterns (Q727190) (← links)
- Counting and generating permutations in regular classes (Q727971) (← links)
- Gray code orders for \(q\)-ary words avoiding a given factor (Q748433) (← links)
- Average complexity of Moore's and Hopcroft's algorithms (Q764328) (← links)
- On primary and secondary repetitions in words (Q764340) (← links)
- Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322) (← links)
- A uniform cube-free morphism is<i>k</i>-power-free for all integers<i>k</i>≥ 4 (Q4638265) (← links)
- (Q5111650) (← links)
- Episturmian words: a survey (Q5321774) (← links)
- A characterization of words of linear complexity (Q5384833) (← links)
- Substitutions par des motifs en dimension 1 (Q5425749) (← links)
- The palindromization map (Q6048431) (← links)
- The square density of words having a sequence of FS-double squares (Q6069178) (← links)
- Quadratic characters with positive partial sums (Q6075456) (← links)
- Construction of general forms of ordinary generating functions for more families of numbers and multiple variables polynomials (Q6100724) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- (Q6150948) (← links)
