The following pages link to Bifix codes and Sturmian words (Q1946105):
Displaying 18 items.
- Recent results on syntactic groups of prefix codes. (Q444391) (← links)
- Neutral and tree sets of arbitrary characteristic (Q728278) (← links)
- On the group of a rational maximal bifix code (Q2178790) (← links)
- The finite index basis property (Q2259171) (← links)
- Bifix codes and interval exchanges (Q2259187) (← links)
- Acyclic, connected and tree sets (Q2339363) (← links)
- Studies on finite Sturmian words (Q2354408) (← links)
- Specular sets (Q2358694) (← links)
- Maximal bifix decoding (Q2514159) (← links)
- BALANCE PROPERTIES OF ARNOUX–RAUZY WORDS (Q2842015) (← links)
- Return words of linear involutions and fundamental groups (Q2986615) (← links)
- Codes and Automata in Minimal Sets (Q3449355) (← links)
- On Arithmetic Progressions in the Generalized Thue-Morse Word (Q3449368) (← links)
- Specular Sets (Q3449371) (← links)
- Enumeration Formulæ in Neutral Sets (Q3451104) (← links)
- Interval exchanges, admissibility and branching Rauzy induction (Q4637855) (← links)
- Eventually dendric shift spaces (Q4991746) (← links)
- A profinite approach to complete bifix decodings of recurrent languages (Q6133256) (← links)
