Recurrent Partial Words and Representable Sets.
From MaRDI portal
Publication:5267519
Recommendations
- Partial words and a theorem of Fine and Wilf revisited
- scientific article; zbMATH DE number 1688349
- On universal partial words for word-patterns and set partitions
- Periodicity properties on partial words
- Recurrent words with constant abelian complexity
- Recurrent partial words
- On sets of indefinitely desubstitutable words
- A periodicity lemma for partial words
- Unavoidable sets of partial words
Cited in
(9)- Computing minimum length representations of sets of words of uniform length
- On universal partial words
- Constructing partial words with subword complexities not achievable by full words
- Recurrence in infinite partial words
- Regular languages of partial words
- Connecting partial words and regular languages
- Recurrent partial words
- scientific article; zbMATH DE number 3943055 (Why is no real title available?)
- On minimal Sturmian partial words
This page was built for publication: Recurrent Partial Words and Representable Sets.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267519)