Book
  • F. Blanchet-Sadri, "Algorithmic Combinatorics on Partial Words." Chapman & Hall/CRC Press, Boca Raton, FL, 2008.

Book Chapter
  • F. Blanchet-Sadri, "Open Problems on Partial Words." In G. Bel-Enguix, M.D. Jimenez-Lopez, and C. Martin-Vide (Eds.), New Developments in Formal Languages and Applications, Ch. 2, Vol. 3, Springer, 2007, pp 11-58.

Refereed Journals
  1. F. Blanchet-Sadri and R.A. Hegstrom, "Partial words and a theorem of Fine and Wilf revisited." Theoretical Computer Science, Vol. 270, No. 1/2, 2002, pp 401-419.
  2. F. Blanchet-Sadri and D.K. Luhmann, "Conjugacy on partial words." Theoretical Computer Science, Vol. 289, No. 1, 2002, pp 297-312.
  3. F. Blanchet-Sadri, "Periodicity on partial words." International Journal of Computers and Mathematics with Applications, Vol. 47, No. 1, 2004, pp 71-82.
  4. F. Blanchet-Sadri and A. Chriscoe, "Local periods and binary partial words: an algorithm." Theoretical Computer Science, Vol. 314, 2004, pp 189-216.
  5. F. Blanchet-Sadri, "Codes, orderings, and partial words." Theoretical Computer Science, Vol. 329, 2004, pp 177-202.
  6. F. Blanchet-Sadri and S. Duncan, "Partial words and the critical factorization theorem." Journal of Combinatorial Theory, Series A, Vol. 109, 2005, pp 221-245.
  7. F. Blanchet-Sadri, "Primitive partial words." Discrete Applied Mathematics, Vol. 148, 2005, pp 195-213.
  8. F. Blanchet-Sadri and A.R. Anavekar, "Testing primitivity on partial words." Discrete Applied Mathematics, Vol. 155, 2007, pp 279-287.
  9. F. Blanchet-Sadri and N.D. Wetzler, "Partial words and the critical factorization theorem revisited." Theoretical Computer Science, Vol. 385, 2007, pp 179-192.
  10. F. Blanchet-Sadri, D. Bal and G. Sisodia, "Graph connectivity, partial words, and a theorem of Fine and Wilf." Information and Computation, Vol. 206, 2008, pp 676-693.
  11. F. Blanchet-Sadri, K. Corcoran, and J. Nyberg, "Periodicity properties on partial words." Information and Computation, Vol. 206, 2008, pp 1057-1064.
  12. F. Blanchet-Sadri, L. Bromberg and K. Zipple, “Remarks on two nonstandard versions of periodicity in words.” International Journal of Foundations of Computer Science, Vol. 19, No. 6, 2008, pp 1439-1448.
  13. F. Blanchet-Sadri, D. Blair and R.V. Lewis, "Equations on partial words." RAIRO-Theoretical Informatics and Applications, Vol. 43, 2009, pp 23-39.
  14. F. Blanchet-Sadri, R. Mercas and G. Scott, “A generalization of Thue freeness for partial words.” Theoretical Computer Science, Vol. 410, 2009, pp 793-800.
  15. F. Blanchet-Sadri, R. Jungers and J. Palumbo, “Testing avoidability of sets of partial words is hard.” Theoretical Computer Science, Vol. 410, 2009, pp 968-972.
  16. F. Blanchet-Sadri, C.D. Davis, J. Dodge, R. Mercas and M. Moorefield, "Unbordered partial words." Discrete Applied Mathematics, Vol. 157, 2009, pp 890-900.
  17. F. Blanchet-Sadri, N.C. Brownstein, A. Kalcic, J. Palumbo and T. Weyand, “Unavoidable sets of partial words.” Theory of Computing Systems, Vol. 45, No. 2, 2009, pp 381-406.
  18. F. Blanchet-Sadri, E. Clader and O. Simpson, “Border correlations of partial words.” Theory of Computing Systems, to appear.
  19. F. Blanchet-Sadri and R. Mercas, “A note on the number of squares in a partial word with one hole.” RAIRO-Theoretical Informatics and Applications, to appear.
  20. F. Blanchet-Sadri, T. Oey and T. Rankin, "Fine and Wilf's theorem for partial words with arbitrarily many weak periods." International Journal of Foundations of Computer Science, to appear.
  21. F. Blanchet-Sadri, R. Mercas and G. Scott, “Counting distinct squares in partial words.” Acta Cybernetica, to appear.
Refereed Conferences
  1. F. Blanchet-Sadri, D. Blair, and R.V. Lewis, "Equations on partial words." In R. Kralovic and P. Urzyczyn (Eds.), MFCS 2006, 31st International Symposium on Mathematical Foundations of Computer Science, August 28-September 1, 2006, Stara Lesna, Slovakia, Lecture Notes in Computer Science, Vol. 4162, Springer-Verlag, Berlin, Heidelberg, 2006, pp 167-178.
  2. F. Blanchet-Sadri, J.D. Gafni and K.H. Wilson, “Correlations of partial words.” In W. Thomas and P. Weil (Eds.), STACS 2007, 24th International Symposium on Theoretical Aspects of Computer Science, February 22-24, 2007, Aachen, Germany, Lecture Notes in Computer Science, Vol. 4393, Springer-Verlag, Berlin, Heidelberg, 2007, pp 97-108.
  3. F. Blanchet-Sadri, N.C. Brownstein and J. Palumbo, “Two element unavoidable sets of partial words.” In T. Harju, J. Karhumäki, and A. Lepistö (Eds), DLT 2007, 11th International Conference on Developments in Language Theory, July 3-6, 2007, Turku, Finland, Lectures Notes in Computer Science, Vol. 4588, Springer-Verlag, Berlin, Heidelberg, 2007, pp 96-107.
  4. F. Blanchet-Sadri, K. Corcoran, and J. Nyberg, "Fine and Wilf's periodicity result on partial words and consequences." LATA 2007, 1st International Conference on Language and Automata Theory and Applications, March 29-April 4, 2007, Tarragona, Spain, GRLMC Report 35/07, pp 115-126.
  5. F. Blanchet-Sadri, T. Oey and T. Rankin, "Computing weak periods of partial words." In E. Csuhaj-Varju and Z. Esik (Eds.), AFL 2008, 12th International Conference on Automata and Formal Languages, May 27-30, 2008, Balatonfured, Hungary, Proceedings, pp 134-145.
  6. F. Blanchet-Sadri, R. Mercas and G. Scott, "Counting distinct squares in partial words." In E. Csuhaj-Varju and Z. Esik (Eds.), AFL 2008, 12th International Conference on Automata and Formal Languages, May 27-30, 2008, Balatonfured, Hungary, Proceedings, pp 122-133.
  7. F. Blanchet-Sadri, E. Allen, C. Byrum, M. Cucuringu and R. Mercas, “Counting distinct partial words.” International Conference on Automata, Languages, and Related Topics, October 21-24, 2008, Debrecen, Hungary.
  8. F. Blanchet-Sadri, M. Cordier, M. Cucuringu and R. Kirsch, “Combinatorics on border correlations of partial words.” International Conference on Automata, Languages, and Related Topics, October 21-24, 2008, Debrecen, Hungary.
  9. F. Blanchet-Sadri, E. Allen, C. Byrum and R. Mercas, "How many holes can an unbordered partial word contain?" In A.H. Dediu, A.M. Ionescu and C. Martin-Vide (Eds.), LATA 2009, 3rd International Conference on Language and Automata Theory and Applications, April 2-8, 2009, Tarragona, Spain, Lectures Notes in Computer Science, Vol. 5457, Springer-Verlag, Berlin, Heidelberg, 2009, pp 176-187.
  10. F. Blanchet-Sadri, R. Mercas, A. Rashin and E. Willett, "An answer to a conjecture on overlaps in partial words using periodicity algorithms." In A.H. Dediu, A.M. Ionescu and C. Martin-Vide (Eds.), LATA 2009, 3rd International Conference on Language and Automata Theory and Applications, April 2-8, 2009, Tarragona, Spain, Lectures Notes in Computer Science, Vol. 5457, Springer-Verlag, Berlin, Heidelberg, 2009, pp 188-199.
  11. B. Blakeley, F. Blanchet-Sadri, J. Gunter and N. Rampersad, "On the complexity of deciding avoidability of sets of partial words." In V. Diekert and D. Nowotka (Eds.), DLT 2009, 13th International Conference on Developments in Language Theory, June 30-July 3, 2009, Stuttgart, Germany, Lectures Notes in Computer Science, Vol. 5583, Springer-Verlag, Berlin, Heidelberg, 2009, pp 113-124.
  12. F. Blanchet-Sadri and B. Shirey, "Periods and binary partial words." WORDS 2009, The 7th International Conference on Words, September 14-18, 2009, Salerno, Italy.
  13. F. Blanchet-Sadri, R. Mercas and K. Wetzler, "The three-squares lemma for partial words with one hole." WORDS 2009, The 7th International Conference on Words, September 14-18, 2009, Salerno, Italy.
Useful Links
Francine Blanchet-Sadri's webpage
REU Site: Algorithmic Combinatorics on Words
Visit the NSF home page.
Acknowledgement: This material is based upon work supported by the National Science Foundation under grant Nos. CCF-0207673, DMS-0452020 and DMS-0754154. The Department of Defense is also gratefully acknowledged.
Disclaimer: Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.
Valid XHTML 1.0! Valid CSS!

This page has been accessed times since January 16, 2007 at 1:00pm EST.