Pages that link to "Item:Q1349698"

The following pages link to Some combinatorial properties of Sturmian words (Q1349698):

Displaying 50 items.

• Sturmian words, Lyndon words and trees (Q1391533) (← links)
• Standard Sturmian morphisms (Q1391534) (← links)
• A representation theorem of the suffixes of characteristic sequences (Q1392545) (← links)
• Euclidean strings (Q1399993) (← links)
• Weak repetitions in Sturmian strings. (Q1401224) (← links)
• Some properties of the factors of Sturmian sequences. (Q1401408) (← links)
• Fine and Wilf words for any periods (Q1433188) (← links)
• Well-balanced sequences (Q1575538) (← links)
• Sturmian words and words with a critical exponent (Q1575554) (← links)
• Repetitions in Sturmian strings (Q1583533) (← links)
• Repetitive perhaps, but certainly not boring (Q1583539) (← links)
• Forbidden words in symbolic dynamics (Q1585506) (← links)
• Words and forbidden factors (Q1605329) (← links)
• Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution (Q1606161) (← links)
• On low-complexity bi-infinite words and their factors (Q1606164) (← links)
• Generalized balances in Sturmian words (Q1613391) (← links)
• Sturmian numeration systems and decompositions to palindromes (Q1750221) (← links)
• Harmonic and gold Sturmian words (Q1827341) (← links)
• Semiperiodic words and root-conjugacy. (Q1853735) (← links)
• Characterisations of balanced words via orderings (Q1884974) (← links)
• Moments of conjugacy classes of binary words (Q1884975) (← links)
• Random generation of finite Sturmian words (Q1917511) (← links)
• Palindromes and Sturmian words (Q1960407) (← links)
• Sturmian morphisms and \(\alpha\)-words (Q1960658) (← links)
• A characterization of Sturmian sequences by indistinguishable asymptotic pairs (Q2033924) (← links)
• Further steps on the reconstruction of convex polyominoes from orthogonal projections (Q2084620) (← links)
• Asymptotic formula for balanced words (Q2116747) (← links)
• Exponents of Diophantine approximation in dimension 2 for a general class of numbers (Q2121977) (← links)
• Words that almost commute (Q2138989) (← links)
• Reprint of: ``Palindromization and construction of Markoff triples'' (Q2192375) (← links)
• A combinatorial view on string attractors (Q2216440) (← links)
• Discrete segments of \(\mathbb{Z}^3\) constructed by synchronization of words (Q2255823) (← links)
• Palindromization and construction of Markoff triples (Q2290618) (← links)
• Obituary: Aldo de Luca 1941--2018 (Q2334412) (← links)
• Sturmian words and the Stern sequence (Q2345447) (← links)
• Studies on finite Sturmian words (Q2354408) (← links)
• The sequence of open and closed prefixes of a Sturmian word (Q2363308) (← links)
• A note on the Markov condition and central words (Q2380082) (← links)
• Minimal complexity of equidistributed infinite permutations (Q2400969) (← links)
• Counting Lyndon factors (Q2401409) (← links)
• On an involution of Christoffel words and Sturmian morphisms (Q2472847) (← links)
• Codes of central Sturmian words (Q2484436) (← links)
• Some characterizations of finite Sturmian words. (Q2490813) (← links)
• Pseudopalindrome closure operators in free monoids (Q2508984) (← links)
• A palindromization map on free monoids (Q2510763) (← links)
• On the structure of bispecial Sturmian words (Q2637643) (← links)
• (Q2704234) (← links)
• Three distance theorems and Sturmian sequences: length governing words (Q2717596) (← links)
• Two-variable word equations (Q2729626) (← links)
• From the Fibonacci word to Sturmian words (Q2770689) (← links)