Pages that link to "Item:Q1391533"
From MaRDI portal
The following pages link to Sturmian words, Lyndon words and trees (Q1391533):
Displaying 22 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)