Author:
Blanchet-Sadri Francine,Allen Emily,Byrum Cameron,Mercaş Robert
Publisher
Springer Berlin Heidelberg
Reference5 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 (2007)
3. Blanchet-Sadri, F.: Primitive partial words. Discrete Applied Mathematics 148, 195–213 (2005)
4. Blanchet-Sadri, F., Davis, C., Dodge, J., Mercaş, R., Moorefield, M.: Unbordered partial words. Discrete Applied Mathematics (2008), doi:10.1016/j.dam.2008.04.004
5. Blanchet-Sadri, F.: Open problems on partial words. In: Bel-Enguix, G., Jiménez-López, M., Martín-Vide, C. (eds.) New Developments in Formal Languages and Applications, pp. 11–58. Springer, Berlin (2007)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Combinatorics on partial word borders;Theoretical Computer Science;2016-01