The following pages link to (Q4529547):
Displaying 50 items.
- On the minimal alphabet size in multidimensional unrepetitive configurations (Q1727746) (← links)
- Realization of aperiodic subshifts and uniform densities in groups (Q1733162) (← links)
- Avoidability of circular formulas (Q1743715) (← links)
- Patterns in the generalized Fibonacci word, applied to games (Q1744753) (← links)
- Anti-powers in infinite words (Q1747764) (← links)
- Improvised divide and conquer approach for the LIS problem (Q1748198) (← links)
- Sturmian numeration systems and decompositions to palindromes (Q1750221) (← links)
- Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols (Q1753110) (← links)
- On \(k\)-abelian palindromes (Q1753996) (← links)
- Convergence of Pascal-like triangles in Parry-Bertrand numeration systems (Q1755585) (← links)
- Periodic scheduling of marked graphs using balanced binary words (Q1758156) (← links)
- Algebraic and combinatorial structures on pairs of twin binary trees (Q1758182) (← links)
- Explicit test sets for iterated morphisms in free monoids and metabelian groups (Q1763708) (← links)
- An extension of the periodicity lemma to longer periods (Q1764895) (← links)
- The standard factorization of Lyndon words: an average point of view (Q1764900) (← links)
- Patterns in words and languages (Q1765231) (← links)
- Dynamical upper bounds for one-dimensional quasicrystals (Q1766708) (← links)
- A note on the Burrows-Wheeler transformation (Q1770410) (← links)
- Partial words and the critical factorization theorem (Q1770435) (← links)
- A combinatorial approach to jumping particles (Q1775543) (← links)
- Action of the symmetric group on sets of skew-tableaux with prescribed matrix realization (Q1779395) (← links)
- Inverse Lyndon words and inverse Lyndon factorizations of words (Q1795498) (← links)
- Centralizers in free group algebras and nonsingular curves (Q1799032) (← links)
- Binomial coefficients and anti-exceedances of even permutations: A combinatorial proof (Q1801794) (← links)
- Morphismes unispectraux. (Unispectral morphisms) (Q1822506) (← links)
- Comment on a remark of Forys (Q1823712) (← links)
- Sturmian words and the permutation that orders fractional parts (Q1826919) (← links)
- Two-pattern strings. I: A recognition algorithm (Q1827270) (← links)
- Digital straightness -- a review (Q1827822) (← links)
- An optimal test on finite unavoidable sets of words (Q1836993) (← links)
- Hierarchie et fermeture de certaines classes de tag-systèmes (Q1837537) (← links)
- An analogue of the plactic monoid for binary search trees (Q1852820) (← links)
- Conway's problem for three-word sets. (Q1853553) (← links)
- Palindrome complexity. (Q1853729) (← links)
- Semiperiodic words and root-conjugacy. (Q1853735) (← links)
- On Fine and Wilf's theorem for bidimensional words. (Q1853743) (← links)
- On some generalizations of the Thue-Morse morphism. (Q1853745) (← links)
- Unavoidable sets of words of uniform length (Q1854517) (← links)
- Periodicity vectors for labelled trees (Q1861576) (← links)
- Invertible substitutions on a three-letter alphabet. (Q1871489) (← links)
- Powers in Sturmian sequences (Q1873773) (← links)
- On a conjecture on bidimensional words. (Q1874389) (← links)
- Many aspects of defect theorems (Q1882912) (← links)
- Uniform words (Q1883404) (← links)
- The structure of invertible substitutions on a three-letter alphabet (Q1883415) (← links)
- \(m\)-balanced words: A generalization of balanced words (Q1884918) (← links)
- Characterisations of balanced words via orderings (Q1884974) (← links)
- Sturmian words, \(\beta\)-shifts, and transcendence (Q1885910) (← links)
- Overlap-free morphisms and finite test-sets (Q1887045) (← links)
- Scaling properties of generalized Carlitz sequences of polynomials (Q1887052) (← links)
