The following pages link to (Q4681771):
Displaying 50 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)
- Segmental partially ordered generalized patterns (Q817817) (← links)
- On the \(t\)-adic Littlewood conjecture (Q821485) (← links)
- Characterization of dense patterns having distinct squares (Q831749) (← links)
- Morphic sequences versus automatic sequences (Q832916) (← links)
- Lyndon + Christoffel = digitally convex (Q834259) (← links)
- Quasiperiodic Sturmian words and morphisms (Q870835) (← links)
- The origins of combinatorics on words (Q872058) (← links)
- Waiting times for clumps of patterns and for structured motifs in random sequences (Q876489) (← links)
- Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. II: Reconstruction with forbidden words (Q895104) (← links)
- A split-based incremental deterministic automata minimization algorithm (Q905684) (← links)
- Maximal repetitions in strings (Q931723) (← links)
- Efficient on-line repetition detection (Q955034) (← links)
- Balance and abelian complexity of the Tribonacci word (Q984024) (← links)
- Optimality of some algorithms to detect quasiperiodicities (Q986546) (← links)
- On the tiling by translation problem (Q1003706) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- Border correlations, lattices, and the subgraph component polynomial (Q1678101) (← links)
- Computing primitively-rooted squares and runs in partial words (Q1678102) (← links)
- Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
- On the shortest distance between orbits and the longest common substring problem (Q1710399) (← links)
- On the minimal alphabet size in multidimensional unrepetitive configurations (Q1727746) (← links)
- Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols (Q1753110) (← links)
