The following pages link to Complexity and special factors (Q1280227):
Displayed 50 items.
- On factors of synchronized sequences (Q410714) (← links)
- Constructing partial words with subword complexities not achievable by full words (Q428848) (← links)
- Bispecial factors in circular non-pushy D0L languages (Q442285) (← links)
- On possible growths of Toeplitz languages (Q536628) (← links)
- The complexity of Fibonacci-like kneading sequences (Q557842) (← links)
- Sequences of linear arithmetical complexity (Q557917) (← links)
- Languages under substitutions and balanced words (Q558187) (← links)
- Some improvements of the \(S\)-adic conjecture (Q651048) (← links)
- On factorially balanced sets of words (Q719290) (← links)
- Subword complexity of uniform D0L words over finite groups (Q719314) (← links)
- Infinite words with finite defect (Q719337) (← links)
- On the complexity of a family of \(k\)-context-free sequences (Q764304) (← links)
- On complexity functions of infinite words associated with generalized Dyck languages (Q954986) (← links)
- Palindromic richness (Q1003605) (← links)
- Sequences with constant number of return words (Q1022352) (← links)
- Directional complexity of the hypercubic billiard (Q1025459) (← links)
- A note on symmetries in the Rauzy graph and factor frequencies (Q1029352) (← links)
- On the infinite permutation generated by the period doubling word (Q1041212) (← links)
- de Bruijn sequences and de Bruijn graphs for a general language (Q1044740) (← links)
- The characterization of \(N\)-écritures and applications to the study of sequences of finally \(n+c^{st}\) complexity (Q1285569) (← links)
- On the combinatorics of finite words (Q1292479) (← links)
- Structure of three-interval exchange transformations. II: A combinatorial description of the trajectories (Q1411299) (← links)
- Forbidden words in symbolic dynamics (Q1585506) (← links)
- Words and forbidden factors (Q1605329) (← links)
- Generalized balances in Sturmian words (Q1613391) (← links)
- Complexity and growth for polygonal billiards (Q1613963) (← links)
- Palindrome complexity. (Q1853729) (← links)
- Semiperiodic words and root-conjugacy. (Q1853735) (← links)
- The subword complexity of a class of infinite binary words (Q2370831) (← links)
- Palindromic complexity of infinite words associated with simple Parry numbers (Q2372771) (← links)
- Recurrence functions of Arnoux-Rauzy sequences, and answer to a question of Morse and Hedlund (Q2372775) (← links)
- Substitution dynamical systems on infinite alphabets (Q2372778) (← links)
- Arithmetics properties of substitutions and infinite automata (Q2372784) (← links)
- Billiard complexity in the hypercube (Q2372812) (← links)
- A geometrical characterization of factors of multidimensional billiard words and some applications (Q2373753) (← links)
- The Gauss map on a class of interval translation mappings (Q2382229) (← links)
- Classification of rotations on the torus \(\mathbb T^2\) (Q2456373) (← links)
- On a class of infinite words with affine factor complexity (Q2465623) (← links)
- Sturmian jungle (or garden?) on multiliteral alphabets (Q2998727) (← links)
- On the D0L Repetition Threshold (Q3060199) (← links)
- Generalized Thue-Morse words and palindromic richness (Q3165663) (← links)
- On possible growths of arithmetical complexity (Q3421906) (← links)
- Sequences of low arithmetical complexity (Q3423138) (← links)
- Combinatoire de mots récurrents de complexité<i>n+2</i> (Q3512597) (← links)
- Drunken man infinite words complexity (Q3526419) (← links)
- On extremal properties of the Fibonacci word (Q3537492) (← links)
- Palindromes in infinite ternary words (Q3653092) (← links)
- On the distribution of characteristic parameters of words (Q4800266) (← links)
- Complexity of infinite words associated with beta-expansions (Q4825393) (← links)
- Words and special factors (Q5941274) (← links)