Pages that link to "Item:Q1392298"
From MaRDI portal
The following pages link to On minimal words with given subword complexity (Q1392298):
Displaying 10 items.
- On minimal Sturmian partial words (Q534335) (← links)
- Elementary sequences, sub-Fibonacci sequences (Q686269) (← links)
- On the minimal complexity of infinite words (Q698629) (← links)
- Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture (Q2020439) (← links)
- Counting minimal semi-Sturmian words (Q2446875) (← links)
- Minimal Discriminating Words Problem Revisited (Q2856588) (← links)
- Computing Minimum Length Representations of Sets of Words of Uniform Length (Q2946043) (← links)
- Minimal Unique Substrings and Minimal Absent Words in a Sliding Window (Q3297764) (← links)
- (Q3409978) (← links)
- (Q4830987) (← links)