The following pages link to Complexity and special factors (Q1280227):
Displaying 50 items.
- Automata and forbidden words (Q293331) (← links)
- Minoration of the complexity function associated to a translation on the torus (Q368519) (← links)
- Languages invariant under more symmetries: overlapping factors versus palindromic richness (Q389460) (← links)
- Palindromic richness for languages invariant under more symmetries (Q391781) (← links)
- 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)
- Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm (Q477772) (← links)
- Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049) (← links)
- Morphic images of episturmian words having finite palindromic defect (Q499487) (← links)
- Thermodynamic formalism and \(k\)-Bonacci substitutions (Q524514) (← 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)
- Neutral and tree sets of arbitrary characteristic (Q728278) (← links)
- On the complexity of a family of \(k\)-context-free sequences (Q764304) (← links)
- On the permutation complexity of the Cantor-like sequences (Q906402) (← 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)
- Polynomial entropy and expansivity (Q1705822) (← links)
- Palindrome complexity. (Q1853729) (← links)
- Semiperiodic words and root-conjugacy. (Q1853735) (← links)
- Spectral properties of Schrödinger operators associated with almost minimal substitution systems (Q2025608) (← links)
- Lie complexity of words (Q2163386) (← links)
- Logarithmic equal-letter runs for BWT of purely morphic words (Q2163991) (← links)
- Mixing properties and entropy bounds of a family of Pisot random substitutions (Q2166101) (← links)
- On generalized highly potential words (Q2215978) (← links)
- The finite index basis property (Q2259171) (← links)
- Subword complexity and power avoidance (Q2326389) (← links)
- Acyclic, connected and tree sets (Q2339363) (← links)
- Specular sets (Q2358694) (← 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)
