Pages that link to "Item:Q3564883"
From MaRDI portal
The following pages link to Hard Counting Problems for Partial Words (Q3564883):
Displaying 5 items.
- Constructing partial words with subword complexities not achievable by full words (Q428848) (← links)
- Number of holes in unavoidable sets of partial words. II. (Q450549) (← links)
- On minimal Sturmian partial words (Q534335) (← links)
- Regular languages of partial words (Q726150) (← links)
- Efficient enumeration of non-equivalent squares in partial words with few holes (Q5971176) (← links)
