The following pages link to Episturmian words: a survey (Q5321774):
Displaying 39 items.
- Introducing privileged words: privileged complexity of Sturmian words (Q388457) (← links)
- Counting distinct palindromes in a word in linear time (Q407601) (← links)
- A standard correspondence on epicentral words (Q444409) (← links)
- Morphic images of episturmian words having finite palindromic defect (Q499487) (← links)
- A geometric interpretation of the Schützenberger group of a minimal subshift (Q517222) (← links)
- On the fixed points of the iterated pseudopalindromic closure operator (Q544882) (← links)
- Balancing and clustering of words in the Burrows-Wheeler transform (Q544888) (← links)
- Special factors and the combinatorics of suffix and factor automata (Q551186) (← links)
- On theta-palindromic richness (Q631773) (← links)
- On the number of episturmian palindromes (Q708221) (← links)
- On z-factorization and c-factorization of standard episturmian words (Q719264) (← links)
- Symmetry groups of infinite words (Q832947) (← links)
- On a generalization of Christoffel words: epichristoffel words (Q837169) (← links)
- Balance and abelian complexity of the Tribonacci word (Q984024) (← links)
- Palindromic richness (Q1003605) (← links)
- Fixed points of Sturmian morphisms and their derivated words (Q1659979) (← links)
- Bifix codes and Sturmian words (Q1946105) (← links)
- On the group of a rational maximal bifix code (Q2178790) (← links)
- Abelian periods of factors of Sturmian words (Q2187128) (← links)
- On non-repetitive complexity of Arnoux-Rauzy words (Q2197452) (← links)
- Some properties of the \(k\)-bonacci words on infinite alphabet (Q2200435) (← links)
- The finite index basis property (Q2259171) (← links)
- A new characteristic property of rich words (Q2271424) (← links)
- Rich square-free words (Q2357378) (← links)
- A connection between palindromic and factor complexity using return words (Q2377963) (← links)
- Quasiperiodic and Lyndon episturmian words (Q2378539) (← links)
- A palindromization map on free monoids (Q2510763) (← links)
- Maximal bifix decoding (Q2514159) (← links)
- On the structure of bispecial Sturmian words (Q2637643) (← links)
- On square factors and critical factors of \(k\)-bonacci words on infinite alphabet (Q2661776) (← links)
- BALANCE PROPERTIES OF ARNOUX–RAUZY WORDS (Q2842015) (← links)
- Lamination languages (Q2874006) (← links)
- Sturmian jungle (or garden?) on multiliteral alphabets (Q2998727) (← links)
- Standard factors of Sturmian words (Q5190084) (← links)
- A characterization of words of linear complexity (Q5384833) (← links)
- Properties of a ternary infinite word (Q6041042) (← links)
- The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group (Q6097068) (← links)
- Clustering and Arnoux-Rauzy words (Q6184901) (← links)
- Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents (Q6201925) (← links)
