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

Book Chapters
  • 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-Verlag, Berlin, Heidelberg, 2008, pp 11-58.

  • F. Blanchet-Sadri, B. Blakeley, J. Gunter, S. Simmons and E. Weissenstein, "Classifying All Avoidable Sets of Partial Words of Size Two." In C. Martin-Vide (Ed.), Scientific Applications of Language Methods, Ch. 2, Imperial College Press, London, 2010, pp 59-101.

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 (Awarded "Journal of Combinatorial Theory, Series A Top Cited Article 2005-2010").
  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 and R. Mercas, “A note on the number of squares in a partial word with one hole.” RAIRO-Theoretical Informatics and Applications, Vol. 43, 2009, pp 767-774.
  19. F. Blanchet-Sadri, R. Mercas and G. Scott, “Counting distinct squares in partial words.” Acta Cybernetica, Vol. 19, 2009, pp 465-477.
  20. F. Blanchet-Sadri, E. Clader and O. Simpson, “Border correlations of partial words.” Theory of Computing Systems, Vol. 47, No. 1, 2010, pp 179-195.
  21. F. Blanchet-Sadri, J. Fowler, J.D. Gafni and K.H. Wilson, “Combinatorics on Partial Word Correlations.” Journal of Combinatorial Theory, Series A, Vol. 117, 2010, pp 607-624.
  22. 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, Vol. 21, No. 5, 2010, 705-722.
  23. B. Blakeley, F. Blanchet-Sadri, J. Gunter and N. Rampersad, "On the complexity of deciding avoidability of sets of partial words." Theoretical Computer Science, Vol. 411, 2010, pp 4263-4271.
  24. F. Blanchet-Sadri and M. Cucuringu, "Counting primitive partial words." Journal of Automata, Languages and Combinatorics, Vol. 15, No. 3/4, 2010, pp 199-227.
  25. F. Blanchet-Sadri, R. Mercas, S. Simmons and E. Weissenstein, "Avoidable binary patterns in partial words." Acta Informatica, Vol. 48, No. 1, 2011, pp 25-41 ("Erratum to: Avoidable binary patterns in partial words." Acta Informatica, Vol. 49, No. 1, 2012, pp 53-54).
  26. F. Blanchet-Sadri and J. Lensmire, "On minimal Sturmian partial words." Discrete Applied Mathematics, Vol. 159, No. 8, 2011, pp 733-745.
  27. F. Blanchet-Sadri, I. Choi and R. Mercas, "Avoiding large squares in partial words." Theoretical Computer Science, Vol. 412, 2011, pp 3752-3758.
  28. F. Blanchet-Sadri, E. Allen, C. Byrum, M. Cucuringu and R. Mercas, “Counting bordered partial words by critical positions.” The Electronic Journal of Combinatorics, Vol. 18, 2011, #P138.
  29. F. Blanchet-Sadri, J. I. Kim, R. Mercas, W. Severa, S. Simmons and D. Xu, "Avoiding abelian squares in partial words." Journal of Combinatorial Theory, Series A, Vol. 119, 2012, pp 257-270.
  30. F. Blanchet-Sadri, S. Simmons and D. Xu, "Abelian repetitions in partial words." Advances in Applied Mathematics, Vol. 48, 2012, pp 194-214.
  31. F. Blanchet-Sadri and R. Mercas, "The three-squares lemma for partial words with one hole." Theoretical Computer Science, Vol. 428, 2012, pp 1-9.
  32. F. Blanchet-Sadri, A. Chakarov, L. Manuelli, J. Schwartz and S. Stich, "Constructing partial words with subword complexities not achievable by full words." Theoretical Computer Science, Vol. 432, 2012, pp 21-27.
  33. F. Blanchet-Sadri, B. Chen and A. Chakarov, "Number of holes in unavoidable sets of partial words I." Journal of Discrete Algorithms, Vol. 14, 2012, pp 55-64.
  34. F. Blanchet-Sadri, S. Ji and E. Reiland, "Number of holes in unavoidable sets of partial words II." Journal of Discrete Algorithms, Vol. 14, 2012, pp 65-73.
  35. F. Blanchet-Sadri, R. Mercas, A. Rashin and E. Willett, "Periodicity algorithms and a conjecture on overlaps in partial words." Theoretical Computer Science, Vol. 443, 2012, pp 35-45.
  36. F. Blanchet-Sadri, T. Mandel and G. Sisodia, "Periods in partial words: An algorithm." Journal of Discrete Algorithms, Vol. 16, 2012, pp 113-128.
  37. F. Blanchet-Sadri, "Algorithmic Combinatorics on partial words." International Journal of Foundations of Computer Science, Vol. 23, No. 6, 2012, pp 1189-1206 (Invited paper).
  38. F. Blanchet-Sadri and S. Simmons, "Deciding representability of sets of words of equal length." Theoretical Computer Science, Vol. 475, 2013, pp 34-46.
  39. F. Blanchet-Sadri and N. Fox, "Abelian-Primitive Partial Words." Theoretical Computer Science, Vol. 485, 2013, pp 16-37.
  40. F. Blanchet-Sadri, B. Chen and S. Munteanu, "A note on constructing infinite binary words with polynomial subword complexity." RAIRO-Theoretical Informatics and Applications, Vol. 47, 2013, pp 195-199.
  41. F. Blanchet-Sadri, S. Simmons, A. Tebbe and A. Veprauskas, "Abelian periods, partial words, and a theorem of Fine and Wilf." RAIRO-Theoretical Informatics and Applications, Vol. 47, 2013, 215-234.
  42. F. Blanchet-Sadri and B. Woodhouse, "Strict bounds for pattern avoidance." Theoretical Computer Science, Vol. 506, 2013, pp 17-28.
  43. F. Blanchet-Sadri and S. Simmons, "Counting minimal semi-sturmian words." Discrete Applied Mathematics, Vol. 161, 2013, pp 2851-2861.
  44. F. Blanchet-Sadri, A. Lohr and S. Scott, "Computing the partial word avoidability indices of binary patterns." Journal of Discrete Algorithms, Vol. 23, 2013, pp 113-118.
  45. F. Blanchet-Sadri, A. Lohr and S. Scott, "Computing the partial word avoidability indices of ternary patterns." Journal of Discrete Algorithms, Vol. 23, 2013, pp 119-142.
  46. F. Blanchet-Sadri, B. Chen and S. Munteanu, "Recurrence in infinite partial words." Theoretical Computer Science, Vol. 524, 2014, pp 41-47.
  47. F. Blanchet-Sadri, Y. Jiao, J.M. Machacek, J.D. Quigley and X. Zhang, "Squares in partial words." Theoretical Computer Science, Vol. 530, 2014, pp 42-57.
  48. F. Blanchet-Sadri, J. Currie, N. Fox and N. Rampersad, "Abelian complexity of fixed point of morphism 0 -> 012, 1 -> 02, 2 -> 1." INTEGERS, Vol. 14, 2014, #A11.
  49. F. Blanchet-Sadri, B. De Winkle and S. Simmons, "Abelian pattern avoidance in partial words." RAIRO-Theoretical Informatics and Applications, Vol. 48, No. 3, 2014, pp 315-339.
  50. E. Balkanski, F. Blanchet-Sadri, M. Kilgore and B. J. Wyatt, "On the state complexity of partial word DFAs." Theoretical Computer Science, to appear.
  51. F. Blanchet-Sadri, N. Fox and N. Rampersad, "On the asymptotic abelian complexity of morphic words." Advances in Applied Mathematics, 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, Lecture 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." In 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 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, Lecture Notes in Computer Science, Vol. 5457, Springer-Verlag, Berlin, Heidelberg, 2009, pp 176-187.
  8. 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, Lecture Notes in Computer Science, Vol. 5457, Springer-Verlag, Berlin, Heidelberg, 2009, pp 188-199.
  9. 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, Lecture Notes in Computer Science, Vol. 5583, Springer-Verlag, Berlin, Heidelberg, 2009, pp 113-124.
  10. F. Blanchet-Sadri and B. Shirey, "Periods and binary partial words." In WORDS 2009, The 7th International Conference on Words, September 14-18, 2009, Salerno, Italy.
  11. F. Blanchet-Sadri, R. Mercas and K. Wetzler, "The three-squares lemma for partial words with one hole." In WORDS 2009, The 7th International Conference on Words, September 14-18, 2009, Salerno, Italy.
  12. F. Blanchet-Sadri, J. I. Kim, R. Mercas, W. Severa and S. Simmons, "Abelian square-free partial words." In A.-H. Dediu, H. Fernau and C. Martin-Vide (Eds.), LATA 2010, 4th International Conference on Language and Automata Theory and Applications, May 24-28, 2010, Trier, Germany, Lecture Notes in Computer Science, Vol. 6031, Springer-Verlag, Berlin, Heidelberg, 2010, pp 94-105.
  13. F. Blanchet-Sadri, R. Mercas, S. Simmons and E. Weissenstein, "Avoidable binary patterns in partial words."In A.-H. Dediu, H. Fernau and C. Martin-Vide (Eds.), LATA 2010, 4th International Conference on Language and Automata Theory and Applications, May 24-28, 2010, Trier, Germany, Lecture Notes in Computer Science, Vol. 6031, Springer-Verlag, Berlin, Heidelberg, 2010, pp 106-117.
  14. F. Blanchet-Sadri, J. Schwartz, S. Stich and B. J. Wyatt, "Binary de Bruijn partial words with one hole." In J. Kratochvil et al. (Eds.), TAMC 2010, 7th Annual Conference on Theory and Applications of Models of Computation, June 7-11, 2010, Prague, Czech Republic, Lecture Notes in Computer Science, Vol. 6108, Springer-Verlag, Berlin, Heidelberg, 2010, pp 128-138.
  15. F. Blanchet-Sadri, A. Tebbe and A. Veprauskas, "Fine and Wilf's theorem for abelian periods in partial words." In JM 2010, 13iemes Journees Montoises d'Informatique Theorique, September 6-10, 2010, Amiens, France.
  16. F. Blanchet-Sadri, B. Chen and A. Chakarov, "Minimum number of holes in unavoidable sets of partial words of size three." In C. S. Iliopoulos and W. F. Smyth (Eds.), IWOCA 2010, 21st International Workshop on Combinatorial Algorithms, July 26-28, 2010, London, United Kingdom, Lecture Notes in Computer Science, Vol. 6460, Springer-Verlag, Berlin, Heidelberg, 2011, 43-55.
  17. F. Blanchet-Sadri and J. Lensmire, “On minimal Sturmian partial words.” In C. Durr and T. Schwentick (Eds.), STACS 2011, 28th International Symposium on Theoretical Aspects of Computer Science, March 10-12, 2011, Dortmund, Germany, LIPIcs 9 Schloss Dagstuhl-Leibniz-Zentrum fur Informatik, 2011, pp 225-236.
  18. F. Blanchet-Sadri, K. Black and A. Zemke, "Unary pattern avoidance in partial words dense with holes." In A.-H. Dediu, S. Inenaga and C. Martin-Vide (Eds.), LATA 2011, 5th International Conference on Language and Automata Theory and Applications, May 26-31, 2011, Tarragona, Spain, Lecture Notes in Computer Science, Vol. 6638, Springer-Verlag, Berlin, Heidelberg, 2011, pp 155-166.
  19. F. Blanchet-Sadri and S. Simmons, "Avoiding abelian powers in partial words." In G. Mauri and A. Leporati (Eds.), DLT 2011, 15th International Conference on Developments in Language Theory, July 19-22, 2011, Milano, Italy, Lecture Notes in Computer Science, Vol. 6795, Springer-Verlag, Berlin, Heidelberg, 2011, pp 70-81.
  20. F. Blanchet-Sadri, S. Nelson and A. Tebbe, "On operations preserving primitivity of partial words with one hole." In P. Domosi and Sz. Ivan (Eds.), AFL 2011, 13th International Conference on Automata and Formal Languages, August 17-22, 2011, Debrecen, Hungary, Proceedings, pp 93-107.
  21. F. Blanchet-Sadri, "Open problems on avoidable patterns in partial words." In P. Domosi and Sz. Ivan (Eds.), AFL 2011, 13th International Conference on Automata and Formal Languages, August 17-22, 2011, Debrecen, Hungary, Proceedings, pp 12-24 (Invited paper).
  22. F. Blanchet-Sadri, T. Mandel and G. Sisodia, "Periods in partial words: An algorithm." In C. S. Iliopoulos and W. F. Smyth (Eds.), IWOCA 2011, 22nd International Workshop on Combinatorial Algorithms, June 20-22, 2011, Victoria, British Columbia, Canada, Lecture Notes in Computer Science, Vol. 7056, Springer-Verlag, Berlin, Heidelberg, 2011, pp 57-70.
  23. F. Blanchet-Sadri, A. Chakarov, L. Manuelli, J. Schwartz and S. Stich, "Recurrent partial words." In P. Ambroz, S. Holub and Z. Masakova (Eds.), WORDS 2011, 8th International Conference on Words, September 12-16, 2011, Prague, Czech Republic, Electronic Proceedings of Theoretical Computer Science, Vol. 63, 2011, pp 71-82.
  24. F. Blanchet-Sadri and S. Simmons, "Deciding representability of sets of words of equal length." In M. Kutrib, N. Moreira and R. Reis (Eds.), DCFS 2012, 14th International Workshop on Descriptional Complexity of Formal Systems, July 23-25, 2012, Braga, Portugal, Lecture Notes in Computer Science, Vol. 7386, Springer-Verlag, Berlin, Heidelberg, 2012, pp 103-116.
  25. F. Blanchet-Sadri, Y. Jiao and J. Machacek, "Squares in binary partial words." In H.-C. Yen and O. H. Ibarra (Eds.), DLT 2012, 16th International Conference on Developments in Language Theory, August 14-17, 2012, Taipei, Taiwan, Lecture Notes in Computer Science, Vol. 7410, Springer-Verlag, Berlin, Heidelberg, 2012, pp 404-415.
  26. F. Blanchet-Sadri and S. Simmons, "Abelian pattern avoidance in partial words." In B. Rovan, V. Sassone and P. Widmayer (Eds.), MFCS 2012, 37th International Symposium on Mathematical Foundations of Computer Science, August 27-31, 2012, Bratislava, Slovakia, Lecture Notes in Computer Science, Vol. 7464, Springer-Verlag, Berlin, Heidelberg, 2012, pp 210-221.
  27. F. Blanchet-Sadri, D. Allums, J. Lensmire and B. J. Wyatt, "Constructing Minimal Partial Words of Maximum Subword Complexity." In JM 2012, 14th Mons Days of Theoretical Computer Science, September 11-14, 2012, Universite catholique de Louvain, Belgium.
  28. F. Blanchet-Sadri, A. Lohr and S. Scott, "Computing the partial word avoidability indices of ternary patterns." In S. Arumugam and B. Smyth (Eds.), IWOCA 2012, 23rd International Workshop on Combinatorial Algorithms, July 19-21, 2012, Tamil Nadu, Lecture Notes in Computer Science, Vol. 7643, Springer-Verlag, Berlin, Heidelberg, 2012, pp 206-218.
  29. F. Blanchet-Sadri and J. Lazarow, "Suffix trees for partial words and the longest common compatible prefix problem." In A.-H. Dediu, C. Martin-Vide and B. Truthe (Eds.), LATA 2013, 7th International Conference on Language and Automata Theory and Applications, April 2-5, 2013, Bilbao, Spain, Lecture Notes in Computer Science, Vol. 7810, Springer-Verlag, Berlin, Heidelberg, 2013, pp 165-176.
  30. F. Blanchet-Sadri, M. Bodnar, N. Fox and J. Hidakatsu, "A graph polynomial approach to primitivity." In A.-H. Dediu, C. Martin-Vide and B. Truthe (Eds.), LATA 2013, 7th International Conference on Language and Automata Theory and Applications, April 2-5, 2013, Bilbao, Spain, Lecture Notes in Computer Science, Vol. 7810, Springer-Verlag, Berlin, Heidelberg, 2013, pp 153-164.
  31. F. Blanchet-Sadri and B. Woodhouse, "Strict bounds for pattern avoidance." In M.-P. Beal and O. Carton (Eds.), DLT 2013, 17th International Conference on Developments in Language Theory, June 18-21, 2013, Paris-Est, France, Lecture Notes in Computer Science, Vol. 7907, Springer-Verlag, Berlin, Heidelberg, 2013, pp 106-117.
  32. F. Blanchet-Sadri and N. Fox, "On the asymptotic abelian complexity of morphic words." In M.-P. Beal and O. Carton (Eds.), DLT 2013, 17th International Conference on Developments in Language Theory, June 18-21, 2013, Paris-Est, France, Lecture Notes in Computer Science, Vol. 7907, Springer-Verlag, Berlin, Heidelberg, 2013, pp 94-105.
  33. E. Balkanski, F. Blanchet-Sadri, M. Kilgore and B. J. Wyatt, "Partial word DFAs." In S. Konstantinidis (Ed.), CIAA 2013, 18th International Conference on Implementation and Application of Automata, July 16-19, 2013, Halifax, Nova Scotia, Canada, Lecture Notes in Computer Science, Vol. 7982, Springer-Verlag, Berlin, Heidelberg, 2013, pp 36-47 (Awarded ``Best Paper Award of CIAA 2013'').
  34. F. Blanchet-Sadri and S. Munteanu, "Deciding representability of words of equal length in polynomial time." In T. Lecroq and L. Mouchard (Eds.), IWOCA 2013, 24th International Workshop on Combinatorial Algorithms, July 10-12, 2013, Rouen, France, Lecture Notes in Computer Science, Vol. 8288, Springer-Verlag, Berlin, Heidelberg, 2013, pp 28-40.
  35. F. Blanchet-Sadri, A. Lohr, S. Simmons and B. Woodhouse, "Computing depths of patterns." In A.-H. Dediu, C. Martin-Vide, J.-L. Sierra-Rodriguez and B. Truthe (Eds.), LATA 2014, 8th International Conference on Language and Automata Theory and Applications, March 10-14, 2014, Madrid, Spain, Lecture Notes in Computer Science, Vol. 8370, Springer-Verlag, Berlin, Heidelberg, 2014, pp 173-185.
  36. F. Blanchet-Sadri, M. Bodnar and B. De Winkle, “New bounds and relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings.” In E. W. Mayr and N. Portier (Eds.), STACS 2014, 31st International Symposium on Theoretical Aspects of Computer Science, March 5-8, 2014, Lyon, France, LIPIcs Schloss Dagstuhl-Leibniz-Zentrum fur Informatik, Vol. 25, 2014, pp 162-173.
  37. F. Blanchet-Sadri, K. Goldner and A. Shackleton, "Minimal partial languages and automata." In M. Holzer and M. Kutrib (Eds.), CIAA 2014, 19th International Conference on Implementation and Application of Automata, July 30-August 2, 2014, Giessen, Germany, Lecture Notes in Computer Science, Vol. 8587, Springer International Publishing Switzerland, 2014, pp 110-123.

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, DMS-0754154, and DMS-1060775. 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.