Pages that link to "Item:Q1349698"
From MaRDI portal
The following pages link to Some combinatorial properties of Sturmian words (Q1349698):
Displaying 50 items.
- Automata and forbidden words (Q293331) (← links)
- Sturmian graphs and integer representations over numeration systems (Q412361) (← links)
- A new geometric approach to Sturmian words (Q428857) (← links)
- Locating factors of a characteristic word via the generalized Zeckendorf representation of numbers (Q441880) (← links)
- A standard correspondence on epicentral words (Q444409) (← links)
- On generating binary words palindromically (Q472173) (← links)
- Standard Sturmian words and automata minimization algorithms (Q496057) (← links)
- Cyclic complexity of words (Q507796) (← links)
- Minimal non-convex words (Q544886) (← links)
- Factors of characteristic words of irrational numbers (Q557819) (← links)
- Languages under substitutions and balanced words (Q558187) (← links)
- A periodicity result of partial words with one hole (Q597324) (← links)
- Combinatorial properties of sequences defined by the billiard in the tesselation triangles (Q671428) (← links)
- Frequencies of factors of Sturmian sequences (Q671519) (← links)
- A division property of the Fibonacci word (Q672965) (← links)
- On the number of episturmian palindromes (Q708221) (← links)
- Characteristic Sturmian words are extremal for the critical factorization theorem (Q714825) (← links)
- On factorially balanced sets of words (Q719290) (← 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)
- Occurrences of palindromes in characteristic Sturmian words (Q818112) (← links)
- Novel results on the number of runs of the Burrows-Wheeler-transform (Q831816) (← links)
- On a generalization of Christoffel words: epichristoffel words (Q837169) (← links)
- Farey codes and languages (Q854840) (← links)
- Palindromic prefixes and episturmian words (Q855827) (← links)
- On Sturmian graphs (Q881581) (← links)
- Words with many palindrome pair factors (Q888638) (← links)
- Graph connectivity, partial words, and a theorem of Fine and Wilf (Q924728) (← links)
- Factors of characteristic words: location and decompositions (Q982654) (← links)
- Sturmian morphisms, the braid group \(B_4\), Christoffel words and bases of \(F_2\) (Q997566) (← links)
- On \(\theta\)-episturmian words (Q1003600) (← links)
- Burrows-Wheeler transform and Sturmian words (Q1007612) (← links)
- On graphs of central episturmian words (Q1041223) (← links)
- On the conjugation of standard morphisms (Q1128481) (← links)
- Unbordered factors of the characteristic sequences of irrational numbers (Q1275094) (← links)
- On the combinatorics of finite words (Q1292479) (← links)
- Fine and Wilf's theorem for three periods and a generalization of Sturmian words (Q1292483) (← links)
- On bispecial factors of the Thue-Morse word (Q1318735) (← links)
- Palindromes in the Fibonacci word (Q1350369) (← links)
- \(\alpha\)-words and factors of characteristic sequences (Q1377868) (← links)
- Sturmian words: structure, combinatorics, and their arithmetics (Q1391137) (← links)
- 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)
- Fine and Wilf words for any periods (Q1433188) (← links)
- Well-balanced sequences (Q1575538) (← links)
- Repetitions in Sturmian strings (Q1583533) (← links)
- Repetitive perhaps, but certainly not boring (Q1583539) (← links)
