Pages that link to "Item:Q1391533"
From MaRDI portal
The following pages link to Sturmian words, Lyndon words and trees (Q1391533):
Displaying 50 items.
- An output-sensitive algorithm to compute the normal vector of a digital plane (Q265048) (← links)
- Markov word patterns and a relation on \(\alpha\)-words (Q317403) (← links)
- Reversible Christoffel factorizations (Q391135) (← links)
- Lyndon words and Fibonacci numbers (Q392802) (← links)
- A standard correspondence on epicentral words (Q444409) (← links)
- On generating binary words palindromically (Q472173) (← links)
- Minimal non-convex words (Q544886) (← links)
- Factors of characteristic words of irrational numbers (Q557819) (← links)
- A periodicity result of partial words with one hole (Q597324) (← links)
- \(\alpha\)-words and the radix order (Q627192) (← links)
- On Christoffel and standard words and their derivatives (Q728275) (← links)
- Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322) (← links)
- Novel results on the number of runs of the Burrows-Wheeler-transform (Q831816) (← links)
- Lyndon + Christoffel = digitally convex (Q834259) (← links)
- Two equivalence relations on digital lines with irrational slopes. A continued fraction approach to upper mechanical words (Q837156) (← links)
- On a generalization of Christoffel words: epichristoffel words (Q837169) (← links)
- Farey codes and languages (Q854840) (← links)
- On prefixal factorizations of words (Q896064) (← links)
- Graph connectivity, partial words, and a theorem of Fine and Wilf (Q924728) (← links)
- Substitutions on two letters, cutting segments and their projections (Q933208) (← links)
- Involutions of epicentral words (Q966143) (← links)
- Sturmian morphisms, the braid group \(B_4\), Christoffel words and bases of \(F_2\) (Q997566) (← links)
- A conjecture on continued fractions (Q1275461) (← links)
- On the combinatorics of finite words (Q1292479) (← links)
- Lyndon words and singular factors of sturmian words (Q1292480) (← links)
- Fine and Wilf's theorem for three periods and a generalization of Sturmian words (Q1292483) (← links)
- Viennot factorization of infinite words (Q1350922) (← links)
- Standard Sturmian morphisms (Q1391534) (← links)
- Euclidean strings (Q1399993) (← links)
- Lyndon factorization of the Prouhet words. (Q1426044) (← links)
- A combinatorial problem on trapezoidal words. (Q1605325) (← links)
- On low-complexity bi-infinite words and their factors (Q1606164) (← links)
- Periodic scheduling of marked graphs using balanced binary words (Q1758156) (← links)
- Harmonic and gold Sturmian words (Q1827341) (← links)
- Moments of conjugacy classes of binary words (Q1884975) (← 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)
- Perfectly clustering words are primitive positive elements of the free group (Q2140464) (← links)
- A combinatorial view on string attractors (Q2216440) (← links)
- Multiplicative analogue of Markoff-Lagrange spectrum and Pisot numbers (Q2227266) (← links)
- Discrete segments of \(\mathbb{Z}^3\) constructed by synchronization of words (Q2255823) (← links)
- Analytical description of digital intersections: minimal parameters and multiscale representation (Q2317875) (← links)
- Sturmian words and the Stern sequence (Q2345447) (← links)
- Studies on finite Sturmian words (Q2354408) (← links)
- Reversals and palindromes in continued fractions (Q2373747) (← links)
- A geometrical characterization of factors of multidimensional billiard words and some applications (Q2373753) (← links)
- Convex digital polygons, maximal digital straight segments and convergence of discrete geometric estimators (Q2384109) (← links)
- Counting Lyndon factors (Q2401409) (← links)
