The following pages link to (Q4341774):
Displaying 50 items.
- Avoidability index for binary patterns with reversal (Q252854) (← links)
- Transitive sofic spacing shifts (Q255429) (← links)
- A ternary square-free sequence avoiding factors equivalent to \(abcacba\) (Q289989) (← links)
- Finding the leftmost critical factorization on unordered alphabet (Q290524) (← links)
- Classification of eventually periodic subshifts (Q298013) (← links)
- Generalized Pascal triangle for binomial coefficients of words (Q308970) (← links)
- Perfect necklaces (Q308973) (← links)
- The quaternionic weighted zeta function of a graph (Q345153) (← links)
- Several extensions of the Parikh matrix \(L\)-morphism (Q355509) (← links)
- On a generalization of abelian equivalence and complexity of infinite words (Q388738) (← links)
- Abelian-primitive partial words (Q388787) (← links)
- Tree shuffle (Q389936) (← links)
- A linear partitioning algorithm for hybrid Lyndons using \(V\)-order (Q390899) (← links)
- The total run length of a word (Q391314) (← links)
- Combinatorial properties of double square tiles (Q391406) (← links)
- Regular languages and partial commutations (Q391641) (← links)
- Lyndon words and Fibonacci numbers (Q392802) (← links)
- Linear computation of unbordered conjugate on unordered alphabet (Q393901) (← links)
- Infinite words containing the minimal number of repetitions (Q396642) (← links)
- Computing the partial word avoidability indices of binary patterns (Q396698) (← links)
- Computing the partial word avoidability indices of ternary patterns (Q396699) (← links)
- On the maximality of languages with combined types of code properties (Q401313) (← links)
- The three squares lemma revisited (Q414439) (← links)
- A parallelogram tile fills the plane by translation in at most two distinct ways (Q423904) (← links)
- Periodicity algorithms and a conjecture on overlaps in partial words (Q442242) (← links)
- Recent results on syntactic groups of prefix codes. (Q444391) (← links)
- Some kinds of primitive and non-primitive words (Q466915) (← links)
- On generating binary words palindromically (Q472173) (← links)
- The pseudopalindromic completion of regular languages (Q476182) (← links)
- An algorithmic toolbox for periodic partial words (Q477348) (← links)
- An algorithm for enumerating all infinite repetitions in a D0L-system (Q491624) (← links)
- Square-free shuffles of words (Q496046) (← links)
- Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049) (← links)
- Palindromic sequences generated from marked morphisms (Q499461) (← links)
- The quaternionic second weighted zeta function of a graph and the Study determinant (Q501222) (← links)
- Relations on words (Q505060) (← links)
- Binary block order Rouen transform (Q507387) (← links)
- Two fast constructions of compact representations of binary words with given set of periods (Q507396) (← links)
- On the density of Lyndon roots in factors (Q507403) (← links)
- Multiplicity of positive periodic solutions in the superlinear indefinite case via coincidence degree (Q507556) (← links)
- Counting the number of non-zero coefficients in rows of generalized Pascal triangles (Q512556) (← links)
- Deciding game invariance (Q515578) (← links)
- Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms (Q515680) (← links)
- Behavior of digital sequences through exotic numeration systems (Q521363) (← links)
- Languages with membership determined by single letter factors (Q529064) (← links)
- Disjunctivity and other properties of sets of pseudo-bordered words (Q530214) (← links)
- Dependence with complete connections and the Gauss-Kuzmin theorem for \(N\)-continued fractions (Q530346) (← links)
- Representations of Khovanov-Lauda-Rouquier algebras and combinatorics of Lyndon words. (Q532541) (← links)
- Higher-order matching polynomials and \(d\)-orthogonality (Q534193) (← links)
- Equations on palindromes and circular words (Q544873) (← links)
