Recurrent Partial Words and Representable Sets.
From MaRDI portal
Publication:5267519
DOI10.25596/JALC-2016-149zbMATH Open1380.68318OpenAlexW2604132601MaRDI QIDQ5267519FDOQ5267519
Authors: Aleksandar Chakarov, Bob Chen, Lucas Manuelli, Sinziana Munteanu, Jarett Schwartz, Slater Stich, F. Blanchet-Sadri
Publication date: 13 June 2017
Full work available at URL: https://doi.org/10.25596/jalc-2016-149
Recommendations
- Partial words and a theorem of Fine and Wilf revisited
- Publication:2762492
- 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)
- On minimal Sturmian partial words
- Regular languages of partial words
- Constructing partial words with subword complexities not achievable by full words
- Recurrence in infinite partial words
- Recurrent partial words
- Connecting partial words and regular languages
- On universal partial words
- Title not available (Why is that?)
- Computing minimum length representations of sets of words of uniform length
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)