The following pages link to (Q4529547):
Displayed 50 items.
- Avoidability index for binary patterns with reversal (Q252854) (← links)
- The \(\beta\)-transformation with a hole (Q256134) (← links)
- On a question of Hof, Knill and Simon on palindromic substitutive systems (Q258070) (← links)
- Smooth finitely computable functions are affine, or why quantum systems cause waves (Q265933) (← links)
- Notes on Schubert, Grothendieck and key polynomials (Q274868) (← links)
- Initial non-repetitive complexity of infinite words (Q284845) (← links)
- Abelian powers and repetitions in Sturmian words (Q287434) (← links)
- A ternary square-free sequence avoiding factors equivalent to \(abcacba\) (Q289989) (← links)
- Linear-size suffix tries (Q294967) (← links)
- Aperiodic pseudorandom number generators based on infinite words (Q306725) (← links)
- Perfect necklaces (Q308973) (← links)
- Stability of discrete-time switching systems with constrained switching sequences (Q311969) (← links)
- Shuffle and Faà di Bruno Hopf algebras in the center problem for ordinary differential equations (Q316700) (← links)
- Markov word patterns and a relation on \(\alpha\)-words (Q317403) (← links)
- Open problems and conjectures related to the theory of mathematical quasicrystals (Q346735) (← links)
- Presentations of Schützenberger groups of minimal subshifts. (Q375868) (← links)
- Subexponential estimates in the height theorem and estimates on numbers of periodic parts of small periods. (Q376143) (← links)
- On the least number of palindromes contained in an infinite word (Q385043) (← links)
- Introducing privileged words: privileged complexity of Sturmian words (Q388457) (← links)
- Simple real-time constant-space string matching (Q390869) (← links)
- Efficient seed computation revisited (Q390905) (← links)
- The total run length of a word (Q391314) (← links)
- A study of Jacobi-Perron boundary words for the generation of discrete planes (Q391409) (← links)
- Regular languages and partial commutations (Q391641) (← links)
- Charge on tableaux and the poset of \(k\)-shapes (Q392800) (← links)
- Lyndon words and Fibonacci numbers (Q392802) (← links)
- Strict bounds for pattern avoidance (Q393106) (← links)
- Optimality of the width-\(w\) non-adjacent form: general characterisation and the case of imaginary quadratic bases (Q394267) (← links)
- On palindromic factorization of words (Q394756) (← links)
- Computing the partial word avoidability indices of binary patterns (Q396698) (← links)
- Computing the partial word avoidability indices of ternary patterns (Q396699) (← links)
- Pairs of orthogonal countable ordinals (Q400437) (← links)
- Palindromes in circular words (Q401312) (← links)
- On the maximality of languages with combined types of code properties (Q401313) (← links)
- Extensions of rich words (Q401472) (← links)
- Minimal critical exponent of quasiperiodic words (Q401485) (← links)
- Application of entropy compression in pattern avoidance (Q405191) (← links)
- A counterexample to a question of Hof, Knill and Simon (Q405294) (← links)
- On vectorizations of unary generalized quantifiers (Q412063) (← links)
- Bass' identity and a coin arrangements lemma (Q412265) (← links)
- Sturmian graphs and integer representations over numeration systems (Q412361) (← links)
- The three-squares lemma for partial words with one hole (Q418740) (← links)
- Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms (Q418752) (← links)
- Square-free words obtained from prefixes by permutations (Q418771) (← links)
- A note on Sturmian words (Q418801) (← links)
- L-system specification of knot-insertion rules for non-uniform B-spline subdivision (Q419478) (← links)
- Selfdual substitutions in dimension one (Q427786) (← links)
- Constructing partial words with subword complexities not achievable by full words (Q428848) (← links)
- A new geometric approach to Sturmian words (Q428857) (← links)
- Fibonacci word patterns in two-way infinite Fibonacci words (Q441849) (← links)