
F. BlanchetSadri and R.A. Hegstrom, "Partial words and a theorem of Fine
and Wilf revisited." Theoretical Computer Science, Vol. 270, No. 1/2, 2002, pp
401419.

F. BlanchetSadri and D.K. Luhmann, "Conjugacy on partial words." Theoretical
Computer Science, Vol. 289, No. 1, 2002, pp 297312.

F. BlanchetSadri, "Periodicity on partial words." International Journal of Computers and Mathematics
with Applications, Vol. 47, No. 1, 2004, pp 7182.

F. BlanchetSadri and A. Chriscoe, "Local periods and binary
partial words:
an algorithm." Theoretical Computer Science, Vol. 314, 2004, pp 189216.

F. BlanchetSadri, "Codes, orderings, and partial words."
Theoretical Computer
Science, Vol. 329, 2004, pp 177202.

F. BlanchetSadri and S. Duncan, "Partial
words and the critical factorization theorem."
Journal of Combinatorial Theory, Series A, Vol. 109, 2005, pp 221245 (Awarded "Journal of Combinatorial Theory,
Series A Top Cited Article 20052010").

F. BlanchetSadri, "Primitive partial words." Discrete Applied Mathematics,
Vol. 148, 2005, pp 195213.

F. BlanchetSadri and A.R. Anavekar,
"Testing primitivity on partial words."
Discrete Applied Mathematics, Vol. 155, 2007, pp 279287.

F. BlanchetSadri and N.D. Wetzler,
"Partial words and the critical factorization theorem revisited." Theoretical Computer Science,
Vol. 385, 2007, pp 179192.

F. BlanchetSadri, D. Bal and G. Sisodia,
"Graph connectivity, partial words, and a theorem of Fine and Wilf." Information and Computation,
Vol. 206, 2008, pp 676693.

F. BlanchetSadri, K. Corcoran, and J. Nyberg, "Periodicity properties on partial
words." Information and Computation, Vol. 206, 2008, pp 10571064.

F. BlanchetSadri, 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 14391448.

F. BlanchetSadri, D. Blair and R.V. Lewis,
"Equations on partial words." RAIROTheoretical Informatics and Applications, Vol. 43, 2009, pp 2339.

F. BlanchetSadri, R. Mercas and G. Scott,
“A generalization of Thue freeness for partial words.”
Theoretical Computer Science, Vol. 410, 2009, pp 793800.

F. BlanchetSadri, R. Jungers and J. Palumbo,
“Testing avoidability of sets of partial words is hard.” Theoretical
Computer Science, Vol. 410, 2009, pp 968972.

F. BlanchetSadri, C.D. Davis, J. Dodge, R. Mercas and M. Moorefield,
"Unbordered partial words." Discrete Applied Mathematics, Vol. 157, 2009, pp 890900.

F. BlanchetSadri, 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 381406.

F. BlanchetSadri and R. Mercas,
“A note on the number of squares in a partial word with
one hole.” RAIROTheoretical Informatics and Applications, Vol. 43, 2009, pp 767774.

F. BlanchetSadri, R. Mercas and G. Scott,
“Counting distinct squares in partial words.” Acta Cybernetica, Vol.
19, 2009, pp 465477.

F. BlanchetSadri, E. Clader and O. Simpson,
“Border correlations of partial
words.” Theory of Computing Systems, Vol. 47, No. 1, 2010, pp 179195.

F. BlanchetSadri, J. Fowler, J.D. Gafni and K.H. Wilson, “Combinatorics on Partial Word Correlations.”
Journal of Combinatorial Theory, Series A, Vol. 117, 2010, pp 607624.

F. BlanchetSadri, 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, 705722.

B. Blakeley, F. BlanchetSadri, J. Gunter and N. Rampersad,
"On the complexity of deciding avoidability of sets of partial words." Theoretical Computer Science, Vol. 411, 2010, pp 42634271.

F. BlanchetSadri and M. Cucuringu,
"Counting primitive partial words." Journal of Automata, Languages and Combinatorics, Vol. 15, No. 3/4, 2010, pp 199227.

F. BlanchetSadri, R. Mercas, S. Simmons and E. Weissenstein,
"Avoidable binary patterns in partial words." Acta Informatica, Vol. 48, No. 1, 2011, pp 2541 ("Erratum to: Avoidable binary patterns in
partial words." Acta Informatica, Vol. 49, No. 1, 2012, pp 5354).

F. BlanchetSadri and J. Lensmire,
"On minimal Sturmian partial words." Discrete Applied Mathematics, Vol. 159, No. 8, 2011, pp 733745.

F. BlanchetSadri, I. Choi and R. Mercas,
"Avoiding large squares in partial words." Theoretical Computer Science, Vol. 412, 2011, pp 37523758.
 F. BlanchetSadri, 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.

F. BlanchetSadri, 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 257270.

F. BlanchetSadri, S. Simmons and D. Xu,
"Abelian repetitions in partial words." Advances in Applied Mathematics, Vol. 48, 2012, pp 194214.

F. BlanchetSadri and R. Mercas, "The
threesquares lemma for partial words with one hole."
Theoretical Computer Science, Vol. 428, 2012, pp 19.

F. BlanchetSadri, 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 2127.

F. BlanchetSadri, B. Chen and A. Chakarov,
"Number of holes in unavoidable sets of partial words I." Journal of Discrete Algorithms, Vol. 14, 2012, pp 5564.

F. BlanchetSadri, S. Ji and E. Reiland,
"Number of holes in unavoidable sets of partial words II." Journal of Discrete Algorithms, Vol. 14, 2012, pp 6573.

F. BlanchetSadri, R. Mercas, A. Rashin and E. Willett,
"Periodicity algorithms and a conjecture on overlaps in partial words." Theoretical Computer Science, Vol. 443, 2012, pp 3545.

F. BlanchetSadri, T. Mandel and G. Sisodia,
"Periods in partial words: An algorithm." Journal of Discrete Algorithms, Vol. 16, 2012, pp 113128.

F. BlanchetSadri,
"Algorithmic Combinatorics on partial words." International Journal of Foundations of Computer Science, Vol. 23, No. 6, 2012, pp 11891206 (Invited
paper).

F. BlanchetSadri and S. Simmons,
"Deciding representability of sets of words of equal length." Theoretical Computer Science, Vol. 475, 2013, pp 3446.

F. BlanchetSadri and N. Fox,
"AbelianPrimitive Partial Words." Theoretical Computer Science, Vol. 485, 2013, pp 1637.

F. BlanchetSadri, B. Chen and S. Munteanu,
"A note on constructing infinite binary words with polynomial subword complexity." RAIROTheoretical Informatics and
Applications, Vol. 47, 2013, pp 195199.

F. BlanchetSadri, S. Simmons, A. Tebbe and A. Veprauskas,
"Abelian periods, partial words, and a theorem of Fine and Wilf." RAIROTheoretical Informatics and Applications, Vol. 47, 2013, 215234.

F. BlanchetSadri and B. Woodhouse,
"Strict bounds for pattern avoidance."
Theoretical Computer Science, Vol. 506, 2013, pp 1728.

F. BlanchetSadri and S. Simmons,
"Counting minimal semisturmian words." Discrete Applied Mathematics, Vol. 161, 2013, pp 28512861.

F. BlanchetSadri, A. Lohr and S. Scott,
"Computing the partial word avoidability indices of binary patterns." Journal of Discrete Algorithms, Vol. 23, 2013, pp 113118.

F. BlanchetSadri, A. Lohr and S. Scott,
"Computing the partial word avoidability indices of ternary patterns." Journal of Discrete Algorithms, Vol. 23, 2013, pp 119142.

F. BlanchetSadri, B. Chen and S. Munteanu,
"Recurrence in infinite partial words."
Theoretical Computer Science, Vol. 524, 2014, pp 4147.

F. BlanchetSadri, Y. Jiao, J.M. Machacek, J.D. Quigley and X. Zhang,
"Squares in partial words."
Theoretical Computer Science, Vol. 530, 2014, pp 4257.

F. BlanchetSadri, 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.

F. BlanchetSadri, B. De Winkle and S. Simmons,
"Abelian pattern avoidance in partial words."
RAIROTheoretical Informatics and Applications, Vol. 48, No. 3, 2014, pp 315339.

E. Balkanski, F. BlanchetSadri, M. Kilgore and B. J. Wyatt,
"On the state complexity of partial word DFAs."
Theoretical Computer Science, to appear.

F. BlanchetSadri, N. Fox and N. Rampersad,
"On the asymptotic abelian complexity of morphic words."
Advances in Applied Mathematics, to appear.


F. BlanchetSadri, 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 28September 1, 2006, Stara Lesna,
Slovakia, Lecture Notes in Computer
Science, Vol. 4162, SpringerVerlag, Berlin, Heidelberg, 2006, pp 167178.

F. BlanchetSadri, 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 2224, 2007, Aachen, Germany, Lecture Notes in Computer Science, Vol.
4393,
SpringerVerlag, Berlin, Heidelberg, 2007, pp 97108.

F. BlanchetSadri, 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 36, 2007, Turku, Finland,
Lecture Notes in Computer Science, Vol. 4588, SpringerVerlag, Berlin, Heidelberg, 2007, pp
96107.

F. BlanchetSadri, 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 29April 4, 2007, Tarragona, Spain, GRLMC Report 35/07, pp 115126.

F. BlanchetSadri, T. Oey and T. Rankin,
"Computing weak periods of partial words." In E. CsuhajVarju and Z. Esik (Eds.), AFL 2008, 12th
International Conference on Automata and Formal Languages, May
2730, 2008, Balatonfured, Hungary, Proceedings, pp 134145.

F. BlanchetSadri, R. Mercas and G. Scott,
"Counting distinct squares in partial words." In E.
CsuhajVarju and Z. Esik (Eds.), AFL
2008, 12th International Conference on Automata and Formal Languages, May
2730, 2008, Balatonfured, Hungary, Proceedings, pp 122133.

F. BlanchetSadri, 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. MartinVide (Eds.), LATA
2009, 3rd International Conference on
Language and Automata Theory
and Applications, April 28, 2009, Tarragona, Spain, Lecture Notes in Computer Science, Vol. 5457,
SpringerVerlag, Berlin, Heidelberg, 2009, pp 176187.

F. BlanchetSadri, 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. MartinVide (Eds.), LATA
2009, 3rd International Conference on
Language and Automata Theory
and Applications, April 28, 2009, Tarragona, Spain, Lecture Notes in Computer Science, Vol. 5457,
SpringerVerlag, Berlin, Heidelberg, 2009, pp 188199.

B. Blakeley, F. BlanchetSadri, 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 30July 3, 2009, Stuttgart, Germany, Lecture Notes in Computer Science, Vol. 5583,
SpringerVerlag, Berlin, Heidelberg, 2009, pp 113124.

F. BlanchetSadri and B. Shirey, "Periods and binary partial
words."
In WORDS 2009, The 7th International Conference on Words, September 1418, 2009, Salerno, Italy.

F. BlanchetSadri, R. Mercas and K. Wetzler, "The
threesquares lemma for partial words with one hole."
In WORDS 2009, The 7th International Conference on Words, September 1418, 2009, Salerno, Italy.

F. BlanchetSadri, J. I. Kim, R. Mercas, W. Severa and S. Simmons,
"Abelian squarefree partial words." In A.H. Dediu, H. Fernau and C. MartinVide (Eds.), LATA
2010, 4th International Conference on
Language and Automata Theory
and Applications, May 2428, 2010, Trier, Germany, Lecture Notes in Computer Science,
Vol. 6031, SpringerVerlag, Berlin, Heidelberg, 2010, pp 94105.

F. BlanchetSadri, R. Mercas, S. Simmons and E. Weissenstein,
"Avoidable binary patterns in partial words."In A.H. Dediu, H. Fernau and C. MartinVide (Eds.), LATA
2010, 4th International Conference on
Language and Automata Theory
and Applications, May 2428, 2010, Trier, Germany, Lecture Notes in Computer Science,
Vol. 6031, SpringerVerlag, Berlin, Heidelberg, 2010, pp 106117.

F. BlanchetSadri, 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 711, 2010, Prague, Czech Republic, Lecture
Notes in Computer Science, Vol. 6108,
SpringerVerlag, Berlin, Heidelberg, 2010, pp 128138.

F. BlanchetSadri, 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 610, 2010, Amiens, France.

F. BlanchetSadri, 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 2628, 2010, London, United Kingdom, Lecture Notes in Computer Science,
Vol. 6460, SpringerVerlag, Berlin, Heidelberg, 2011, 4355.

F. BlanchetSadri 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 1012, 2011, Dortmund, Germany, LIPIcs 9 Schloss DagstuhlLeibnizZentrum fur Informatik, 2011,
pp 225236.

F. BlanchetSadri, K. Black and A. Zemke,
"Unary pattern avoidance in partial words dense with holes."
In A.H. Dediu, S. Inenaga and C. MartinVide (Eds.), LATA
2011, 5th International Conference on
Language and Automata Theory
and Applications, May 2631, 2011, Tarragona, Spain, Lecture Notes in Computer Science,
Vol. 6638, SpringerVerlag, Berlin, Heidelberg, 2011, pp 155166.

F. BlanchetSadri 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 1922, 2011, Milano, Italy, Lecture Notes in Computer Science, Vol. 6795,
SpringerVerlag, Berlin, Heidelberg, 2011, pp 7081.

F. BlanchetSadri, 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 1722, 2011, Debrecen, Hungary, Proceedings, pp 93107.

F. BlanchetSadri,
"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 1722, 2011, Debrecen, Hungary, Proceedings, pp 1224 (Invited paper).

F. BlanchetSadri, 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 2022, 2011, Victoria, British Columbia, Canada, Lecture
Notes in Computer Science, Vol. 7056, SpringerVerlag, Berlin, Heidelberg, 2011, pp 5770.

F. BlanchetSadri, 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 1216, 2011, Prague, Czech Republic,
Electronic Proceedings of Theoretical Computer Science, Vol. 63, 2011, pp 7182.

F. BlanchetSadri 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 2325, 2012, Braga, Portugal, Lecture Notes in Computer Science,
Vol. 7386, SpringerVerlag, Berlin, Heidelberg, 2012, pp 103116.

F. BlanchetSadri, 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 1417, 2012, Taipei, Taiwan, Lecture Notes in Computer Science,
Vol. 7410, SpringerVerlag, Berlin, Heidelberg, 2012, pp 404415.

F. BlanchetSadri 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 2731, 2012, Bratislava,
Slovakia, Lecture Notes in Computer
Science, Vol. 7464, SpringerVerlag, Berlin, Heidelberg, 2012, pp 210221.

F. BlanchetSadri, 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 1114, 2012, Universite catholique de Louvain, Belgium.

F. BlanchetSadri, 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 1921, 2012, Tamil Nadu, Lecture Notes in Computer Science, Vol.
7643, SpringerVerlag,
Berlin, Heidelberg, 2012, pp 206218.

F. BlanchetSadri and J. Lazarow,
"Suffix trees for partial words and the longest common compatible prefix problem."
In A.H. Dediu, C. MartinVide and B. Truthe (Eds.), LATA
2013, 7th International Conference on
Language and Automata Theory
and Applications, April 25, 2013, Bilbao, Spain, Lecture Notes in Computer Science, Vol. 7810, SpringerVerlag, Berlin, Heidelberg, 2013, pp 165176.

F. BlanchetSadri, M. Bodnar, N. Fox and J. Hidakatsu,
"A graph polynomial approach to primitivity."
In A.H. Dediu, C. MartinVide and B. Truthe (Eds.), LATA
2013, 7th International Conference on
Language and Automata Theory
and Applications, April 25, 2013, Bilbao, Spain, Lecture Notes in Computer Science, Vol. 7810, SpringerVerlag, Berlin, Heidelberg, 2013, pp 153164.

F. BlanchetSadri 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 1821, 2013, ParisEst, France, Lecture Notes in Computer Science, Vol. 7907, SpringerVerlag, Berlin, Heidelberg, 2013, pp 106117.

F. BlanchetSadri 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 1821, 2013, ParisEst, France, Lecture Notes in Computer Science, Vol. 7907, SpringerVerlag, Berlin, Heidelberg, 2013, pp 94105.

E. Balkanski, F. BlanchetSadri, 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 1619, 2013, Halifax, Nova Scotia, Canada, Lecture Notes in Computer Science, Vol. 7982, SpringerVerlag, Berlin, Heidelberg, 2013, pp
3647 (Awarded ``Best Paper Award of CIAA 2013'').

F. BlanchetSadri 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 1012, 2013, Rouen, France,
Lecture Notes in Computer Science, Vol. 8288, SpringerVerlag, Berlin, Heidelberg, 2013, pp 2840.

F. BlanchetSadri, A. Lohr, S. Simmons and B. Woodhouse,
"Computing depths of patterns."
In A.H. Dediu, C. MartinVide, J.L. SierraRodriguez and B. Truthe (Eds.), LATA
2014, 8th International Conference on
Language and Automata Theory
and Applications, March 1014, 2014, Madrid, Spain, Lecture Notes in Computer Science, Vol. 8370, SpringerVerlag, Berlin, Heidelberg, 2014, pp
173185.

F. BlanchetSadri, 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 58, 2014, Lyon, France, LIPIcs Schloss DagstuhlLeibnizZentrum fur Informatik, Vol. 25, 2014,
pp 162173.

F. BlanchetSadri, 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 30August 2, 2014, Giessen, Germany, Lecture Notes in Computer Science, Vol. 8587, Springer International Publishing Switzerland, 2014,
pp 110123.
