The following pages link to (Q4529547):
Displaying 50 items.
- On a class of infinite words with affine factor complexity (Q2465623) (← links)
- Syntactical and automatic properties of sets of polynomials over finite fields (Q2469487) (← links)
- Codimensions of algebras and growth functions (Q2469879) (← links)
- Symmetrized \(\beta \)-integers (Q2474235) (← links)
- Right coideal subalgebras in \(U_q(\mathfrak{sl}_{n+1})\) (Q2474289) (← links)
- Subword complexity and projection bodies (Q2474326) (← links)
- Breaking the rhythm on graphs (Q2476277) (← links)
- A new combinatorial approach to sequence comparison (Q2481558) (← links)
- A basis for the right quantum algebra and the ``\(1= q\)'' principle (Q2481679) (← links)
- On different generalizations of episturmian words (Q2481949) (← links)
- Words derivated from Sturmian words (Q2484435) (← links)
- Commutation with codes (Q2484442) (← links)
- Fractional parts of powers and Sturmian words (Q2487990) (← links)
- Binary number systems for \(\mathbb Z^{k}\) (Q2490144) (← links)
- Sequential? (Q2490822) (← links)
- Centers in domains with quadratic growth. (Q2496129) (← links)
- Substitution dynamical systems: characterization of linear repetitivity and applications (Q2496696) (← links)
- Language structure of pattern Sturmian words (Q2502894) (← links)
- Averages of automatic sequences (Q2503300) (← links)
- Periods in extensions of words (Q2509152) (← links)
- A palindromization map on free monoids (Q2510763) (← links)
- Searching for Zimin patterns (Q2512657) (← links)
- Maximal bifix decoding (Q2514159) (← links)
- Pattern avoidance in partial words over a ternary alphabet (Q2517160) (← links)
- The descent statistic on involutions is not log-concave (Q2519791) (← links)
- The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography (Q2566002) (← links)
- Inequalities characterizing standard Sturmian and episturmian words (Q2566013) (← links)
- Smooth words over arbitrary alphabets (Q2566015) (← links)
- Arithmetic Meyer sets and finite automata (Q2568439) (← links)
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares (Q2568974) (← links)
- Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417) (← links)
- The non-parametrizability of the word equation \(xyz=zvx\): a short proof (Q2575750) (← links)
- A generalization of repetition threshold (Q2575754) (← links)
- A characterization of periodicity of bi-infinite words (Q2576886) (← links)
- A multidimensional critical factorization theorem (Q2581347) (← links)
- Rauzy substitutions and multi-dimensional Sturmian words (Q2581358) (← links)
- Braided version of Shirshov-Witt theorem (Q2581394) (← links)
- On a Quillen adjunction between the categories of differential graded and simplicial coalgebras (Q2631917) (← links)
- Avoiding letter patterns in ternary square-free words (Q2635082) (← links)
- Doubled patterns are 3-avoidable (Q2635083) (← links)
- The \(D\)-representation of nonnegative integers and the Fibonacci factorization of suffixes of infinite Fibonacci words (Q2636829) (← links)
- Recurrence in infinite partial words (Q2637347) (← links)
- On the structure of bispecial Sturmian words (Q2637643) (← links)
- Noncommutative LR coefficients and crystal reflection operators (Q2660381) (← links)
- Primitive sets of words (Q2662680) (← links)
- On Sturmian substitutions closed under derivation (Q2663049) (← links)
- Automatic winning shifts (Q2672264) (← links)
- On minimal critical exponent of balanced sequences (Q2672583) (← links)
- Avoiding square-free words on free groups (Q2672587) (← links)
- A refinement of the Murnaghan-Nakayama rule by descents for border strip tableaux (Q2680917) (← links)
