Pages that link to "Item:Q5267519"
From MaRDI portal
The following pages link to Recurrent Partial Words and Representable Sets. (Q5267519):
Displaying 8 items.
- Constructing partial words with subword complexities not achievable by full words (Q428848) (← links)
- On minimal Sturmian partial words (Q534335) (← links)
- Regular languages of partial words (Q726150) (← links)
- On universal partial words (Q1689916) (← links)
- Computing minimum length representations of sets of words of uniform length (Q2355702) (← links)
- Recurrence in infinite partial words (Q2637347) (← links)
- Recurrent partial words (Q2789516) (← links)
- (Q3714481) (← links)