Author:
Blanchet-Sadri Francine,Rashin Abraham
Publisher
Springer International Publishing
Reference9 articles.
1. Berstel, J., Boasson, L.: Partial words and a theorem of Fine and Wilf. Theoretical Computer Science 218, 135–141 (1999)
2. Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall/CRC Press, Boca Raton (2008)
3. Blanchet-Sadri, F., Mercaş, R., Rashin, A., Willett, E.: Periodicity algorithms and a conjecture on overlaps in partial words. Theoretical Computer Science 443, 35–45 (2012)
4. Blanchet-Sadri, F., Mercaş, R., Scott, G.: A generalization of Thue freeness for partial words. Theoretical Computer Science 410, 793–800 (2009)
5. Fischer, M., Paterson, M.: String matching and other products. In: Karp, R. (ed.) 7th SIAM-AMS Complexity of Computation, pp. 113–125 (1974)