Areas of Interest
 Algebraic Theory of Languages and Automata
 Algorithms and Theory of Computing
 Bioinformatics and Computational Biology
 Coding and Information Theory
 Combinatorics
 Discrete Mathematics
 Group and Semigroup Theory
 Logic
Society Memberships
 AMS American Mathematical Society
 ACM Association for Computing Machinery
 MAA Mathematical Association of America
 SIGACT Special Interest Group on Algorithms and Computation Theory
Book
 F. BlanchetSadri, "Algorithmic Combinatorics on Partial Words." Chapman & Hall/CRC Press, Boca Raton, FL, 2008.
Book Chapters
 F. BlanchetSadri, "Open Problems on Partial Words." In G. BelEnguix, M.D. JimenezLopez, and C. MartinVide (Eds.), New Developments in Formal Languages and Applications, Ch. 2, Vol. 3, SpringerVerlag, Berlin, Heidelberg, 2008, pp 1158.
 F. BlanchetSadri, B. Blakeley, J. Gunter, S. Simmons and E. Weissenstein, "Classifying All Avoidable Sets of Partial Words of Size Two." In C. MartinVide (Ed.), Scientific Applications of Language Methods, Ch.2, Imperial College Press, London, 2010, pp 59101.
Selected Refereed Journals
 F. BlanchetSadri, "Games, Equations and the DotDepth Hierarchy."
International Journal of Computers and Mathematics with Applications, Vol. 18, No. 9, 1989, pp
809822.
 F. BlanchetSadri, "On DotDepth Two." RAIROTheoretical Informatics and Applications, Vol. 24, No. 6, 1990, pp 521529.
 F. BlanchetSadri, "Games, Equations and DotDepth Two Monoids." Discrete
Applied Mathematics, Vol. 39, No. 2, 1992, pp 99111.
 F. BlanchetSadri, "The DotDepth of a Generating Class of Aperiodic
Monoids is Computable." International Journal of Foundations of Computer Science, Vol. 3, No.
4, 1992, pp 419442.
 F. BlanchetSadri, "Equations and DotDepth One." Semigroup Forum,
Vo. 47, No. 3, 1993, pp 305317.
 F. BlanchetSadri, "Equations and Monoid Varieties of DotDepth One
and Two." Theoretical Computer Science, Vol. 123, No. 2, 1994, pp 239258.
 F. BlanchetSadri and X.H. Zhang, "Equations on the Semidirect Product
of a Finite Semilattice by a Finite Commutative Monoid." Semigroup Forum,
Vol. 49, No. 1, 1994, pp 6781.
 F. BlanchetSadri, "On a Complete Set of Generators for DotDepth Two."
Discrete Applied Mathematics, Vol. 50, No. 1, 1994, pp 125.
 F. BlanchetSadri, "Equations on the Semidirect Product of a Finite
Semilattice by a Jtrivial Monoid of Height k." RAIROTheoretical Informatics and Applications, Vol. 29, No. 3, 1995, pp 157170.
 F. BlanchetSadri, "Some Logical Characterizations of the DotDepth
Hierarchy and Applications." Journal of Computer and System Sciences, Vol. 51, No.
2, 1995, pp 324337.
 F. BlanchetSadri, "Inclusion Relations between some Congruences related
to the DotDepth Hierarchy." Discrete Applied Mathematics, Vol. 68, 1996,
pp 3371.
 F. BlanchetSadri, "On Semidirect and TwoSided Semidirect Products
of Finite Jtrivial Monoids." RAIROTheoretical Informatics and Applications, Vo. 30, No. 5, 1996, pp 457482.
 F. BlanchetSadri, "Equations on Semidirect Product of Commutative
Semigroups." Semigroup Forum, Vol. 55, No. 1, 1997, pp 8088.
 F. BlanchetSadri, "On the Semidirect Product of the Pseudovariety
of Semilattices by a Locally Finite Pseudovariety of Groups." RAIROTheoretical Informatics and Applications, Vol. 31, No. 3, 1997, pp
237250.
 F. BlanchetSadri and F.D. Gaddis, "On a Product of Finite Monoids."
Semigroup Forum, Vol. 57, 1998, pp 7591.
 F. BlanchetSadri, "Trees, Congruences and Varieties of Finite Semigroups."
Discrete Applied Mathematics, Vol. 86, 1998, pp 157179.
 F. BlanchetSadri and C. Morgan, "Multiset and Set Decipherable Codes."
International Journal of Computers and Mathematics with Applications, Vol. 41, No. 10/11, 2001,
pp 12571262.
 F. BlanchetSadri, "On Unique, Multiset, and Set Decipherability of
ThreeWord Codes." IEEE Transactions on Information Theory, Vol. 47,
No. 5, 2001, pp 17451757.
 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 T. Howell, "Note on Decipherability of ThreeWord
Codes." International Journal of Mathematics and Mathematical Sciences,
Vol. 30, No. 8, 2002, pp 491504.
 F. BlanchetSadri and D.K. Luhmann, "Conjugacy on Partial Words."
Theoretical Computer Science, Vol. 289, No. 1, 2002, pp 297312.
 F. BlanchetSadri, "A Periodicity Result of Partial Words with One
Hole." International Journal of Computers and Mathematics with Applications, Vol. 46, No. 5/6,
2003, pp 813820.
 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.
 L. Zhang and F. BlanchetSadri,
"Algorithms for Approximate kCovering of Strings."
International Journal of Foundations of Computer Science,
Vol. 16, No. 6, 2005, pp 12311251.
 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 on 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, pp 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, 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, 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 an Extension of a Theorem of Fine and Wilf.” RAIROTheoretical Informatics and
Applications, Vol. 47, 2013, pp 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 Avoidablity Indices of Binary Patterns.” Journal of Discrete Algorithms, Vol. 23, 2013, pp
113118.

F. BlanchetSadri, A. Lohr and S. Scott, “Computing the Partial Word Avoidablity 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, 4147.

F. BlanchetSadri, B. De Winkle and S. Simmons, “Abelian Pattern Avoidance in Partial Words.” RAIROTheoretical Informatics and Applications, to appear.

F. BlanchetSadri, J. Currie, N. Fox and N. Rampersad, “Abelian Complexity of Fixed Point of Morphism 0 > 012, 1 > 02, 2 > 1.” The Electronic Journal of
Combinatorial Number Theory, to appear.

F. BlanchetSadri, Y. Jiao, J. M. Machacek, J.D. Quigley and X. Zhang, “Squares in Partial Words.” Theoretical Computer Science, to appear.

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 and M. Cucuringu, “Counting Primitive Partial Words.” Journal of Automata, Languages and
Combinatorics,
to
appear.
Selected Refereed Conferences

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 Results 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, pp 4345.
 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 Avoidablity Indices of Ternary Patterns.” in
S. Arumugam and B. Smyth (Eds.), IWOCA
2012, 23rd International Workshop on Combinatorial Algorithms, July 1921, 2012, Tamil Nadu, India, 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 Sets 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 Extended 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.
Selected Talks
 Jeux, Equations, et Hierarchies d'Arbres, Laboratoire d'Informatique Theorique et de Programmation, Universite ParisVI, Paris, France, 1995.
 Games, Equations, and Tree Hierarchies, SUNY at Binghamton, 1996.
 Combinatoire des Mots Partiels, LIAFA Laboratoire d'Informatique Algorithmique: Fondements et Applications, Universite Paris 7, Paris, France, 2000.
 On Partial Words, Concordia University, Montreal, P. Quebec, Canada, 2001.
 Mots Partiels et Periodicite, LIAFA Laboratoire d'Informatique Algorithmique: Fondements et Applications, Universite Paris 7, Paris, France, 2004.
 Partial Words and Three Periodicity Results, University of Debrecen, Debrecen, Hungary, 2005.
 On Partial Words, University of Debrecen, Debrecen, Hungary, 2005.
 Mots Partiels: Equations et Applications, LIAFA Laboratoire d'Informatique Algorithmique: Fondements et Applications, Universite Paris 7, Paris, France, 2005.
 Partial Words, 5th International Ph.D. School in Formal Languages and Applications, Tarragona, Spain, 2006 (10 hours).
 Partial Words, SCRA 2006FIM XIII, Thirteenth International Conference on Interdisciplinary Mathematical & Statistical Techniques, New University of LisbonTomar Polytechnic Institute, LisbonTomar, Portugal, 2006 (Plenary Talk).
 Algorithmic Combinatorics on Words, SCRA 2006FIM XIII, Thirteenth International Conference on Interdisciplinary Mathematical & Statistical Techniques, New University of LisbonTomar Polytechnic Institute, LisbonTomar, Portugal, 2006 (Invited Talk on Undergraduate Research in Interdisciplinary Mathematics).
 Counting Unbordered Partial Words, College of Nyiregyhaza, Institute of Mathematics and Computer Science, Nyiregyhaza, Hungary, May 23, 2008 (joint work with M. Cucuringu, J. Dodge and R. Mercas).
 Periods, Partial Words, and a Result of Guibas and Odlyzko, DM08, SIAM Conference on Discrete Mathematics, Burlington, Vermont, June 19, 2008 (joint work with B. Shirey).
 Counting Distinct Partial Words, International Conference on Automata, Languages and Related Topics, Debrecen, Hungary, October 2124, 2008 (joint work with E. Allen, C. Byrum, M. Cucuringu and R. Mercas).
 Combinatorics on Border Correlations of Partial Words, International Conference on Automata, Languages and Related Topics, Debrecen, Hungary, October 2124, 2008 (joint work with M. Cordier, M. Cucuringu and R. Kirsch).
 Combinatorics on Border Correlations of Partial Words, Joint Mathematics Meetings, AMS Session on Combinatorics, II, Washington, DC, January 6, 2009 (joint work with M. Cordier, M. Cucuringu and R. Kirsch).
 The ThreeSquares Lemma for Partial Words with One Hole, College of Nyiregyhaza, Institute of Mathematics and Computer Science, Nyiregyhaza, Hungary, September 22, 2009 (joint work with R. Mercas and K. Wetzler).
 Computing Periods in Partial Words, DM10, SIAM Conference on Discrete Mathematics, Austin, Texas, June 16, 2010 (joint work with J. Carraher, T. Mandel, B. Shirey and G. Sisodia).
 Counting Bordered Partial Words by Critical Positions, DM10, SIAM Conference on Discrete Mathematics, Austin, Texas, June 16, 2010 (joint work with E. Allen and J. Lensmire).
 Algorithmic Combinatorics on Partial Words, AFL 2011, Thirteenth International Conference on Automata and Formal Languages, Hungarian Academy of Sciences, Debrecen, Hungary, August 22, 2011 (One Hour Invited Lecture).
 Algorithmic Combinatorics on Partial Words, Old Dominion University, Electrical and Computer Engineering Department, Norfolk, Virginia, November 4, 2011 (Invited Talk).
 Subword Languages of Infinite Partial Words, Joint Mathematics Meetings, Boston, MA, January 6, 2012 (joint work with B. Chen and S. Munteanu).
 Counting Minimal Sturmian Words, DM12, SIAM Conference on Discrete Mathematics, Halifax, Nova Scotia, Canada, June 20, 2012 (joint work with S. Simmons).
 Unavoidable Sets, DM12, SIAM Conference on Discrete Mathematics, Halifax, Nova Scotia, Canada, June 20, 2012 (joint work with L. Flapan, S. Ji, E. Reiland and S. Watkins).
 Recurrence in Infinite Partial Words, DM12, SIAM Conference on Discrete Mathematics, Halifax, Nova Scotia, Canada, June 20, 2012 (joint work with B. Chen and S. Munteanu).
 Partial Word Representation, Fields Workshop on Challenges in Combinatorics on Words, Fields Institute, Toronto, Ontario, Canada, April 22, 2013.
 Strict Bounds for Pattern Avoidance, Fields Workshop on Challenges in Combinatorics on Words, Fields Institute, Toronto, Ontario, Canada, April 25, 2013 (joint work with B. Woodhouse).
 Algorithmic Combinatorics on Partial Words, The 28th Clemson MiniConference on Discrete Mathematics and Algorithms, Clemson University, Department of Mathematics, Clemson, South Carolina, October 4, 2013 (Invited Talk).
Selected Research Grants
REU Site: Algorithmic Combinatorics on Words 20112014
NSF (Individual), National Science Foundation (DMS Division of Mathematical Sciences), 20112014.
PROJECT SUMMARY
This “Research Experiences for Undergraduates (REU)” project entitled Algorithmic Combinatorics on Words 20112014 involves students at the crossroads between Mathematics and Computer Science. Words, or sequences of symbols over a finite alphabet, are natural objects in several research areas including group theory, number theory, automata and formal language theory, coding theory, and theory of algorithms. This project will provide unique opportunities for summer research for ten students per year for an eightweek period each year.
The five goals or objectives for student activities are: A first objective of this interdisciplinary project is to investigate challenging problems of current interest related to partial words, or sequences that may have some undefined positions. Research topics include computing bounds on the lengths of de Bruijn partial words, counting the number of distinct squares in partial words, and constructing abelian repetitionfree partial words. Combinatorics on partial words is a promising line of research that has practical uses in several areas, notably in molecular biology and bioinspired computing, as well as in the design of a new generation of pattern matching algorithms. Two types of research opportunities will be emphasized:
 computer related research, with students writing programs to perform experiments on partial words and to implement algorithms; and
 combinatorics related research, with students investigating properties of partial words to generate conjectures, to prove theorems, and to discover algorithms.
While achieving this objective, a second objective of the project is for students to develop superior skills in mathematical writing and oral communication. A third objective of this project is to submit the resulting original and high quality research on algorithmic combinatorics on words done with undergraduate students to leading journals and to encourage them to present it at national/international meetings or conferences. A fourth objective is for students to gain experience in the use of computers and their interaction in mathematical research. In addition, students will establish World Wide Web server interfaces for automated use of the programs related to the discovered combinatorial algorithms. Although student participants will be selected based on merit after a nationwide recruitment from a broad range of colleges and universities, a fifth objective of the project is to encourage the participation of underrepresented groups including women, minorities, and persons with disabilities. As a result of taking part in this project, students will get motivated and will become better prepared to pursue advanced degree programs in mathematical sciences.
REU Site: Algorithmic Combinatorics on Words 20082011
NSF (Individual), National Science Foundation (DMS Division of Mathematical Sciences), 20082011.
REU Site: Algorithmic Combinatorics on Words
NSF (Individual), National Science Foundation (DMS Division of Mathematical Sciences), 20052008.
Computing Patterns in Strings
NSF (Individual), National Science Foundation (75% RUI Theory of Computing and 25% RUI Algebra, Number Theory, and Combinatorics), 20022005.PROJECT SUMMARY
The problem of computing patterns in sequences or strings of characters from a finite alphabet has important applications in numerous areas of computer science, notably in data compression, information theory, and pattern matching. This problem has also important applications in biology. The stimulus for such recent works is the study of biological sequences such as DNA and protein that play a central role in molecular biology. DNA sequences can be viewed as quite long but finite strings of nucleotides of 4 different types, while protein sequences can be viewed as finite strings of amino acids of 20 possible types. Patterns such as periodicities and repetitions make up a significant fraction of both DNA and protein sequences. Although the functions of these patterns are not well understood, they appear important for understanding the expression, regulation and evolution of a biological sequence. These patterns can be used to identify the sequence among other sequences, an application that plays a role in genetic fingerprinting. Repetitions in biological sequences have been associated with human genetic diseases. They also complicate multiple sequence alignment because matches may be present in numerous places.
The literature has generally considered problems in which a period u of a repetition is invariant. It has been required that occurrences of u match each other exactly. Due to the action of evolutionary mutation, patterns in biological strings are seldom exact but rather approximate. It therefore becomes necessary to recognize u' as an occurence of u if the distance between u' and u is bounded by a certain threshold. Several definitions of distance have been proposed like the Hamming distance which counts the minimum number of character substitutions required to transform u' into u, and the edit distance which counts the minimum number of substitutions, insertions, and deletions of characters required to transform u' into u. Although there is an enormous literature dealing with approximate pattern matching according to these and other definitions of distance, very little is known on approximate repetitions, a version of repetitions where errors are allowed, and much remains to be done.
Given the importance of patterns in biological strings and the exponential growth in the size of the DNA database, it is important to develop efficient methods for detecting these patterns. This project studies patterns such as periodicities, repetitions, covers, and seeds and their approximate versions built upon various commonly used distance measures. It is natural to consider approximate string matching techniques when developing algorithms for approximate patterns. Techniques that might prove useful include recent combinatorial techniques related to partial strings which are strings where a number of gap characters are allowed. Techniques also include the cover array, the highest scoring paths in weighted grid graphs, the probabilistic models that have been proposed for repetitions, and the subtree max gap problem which seems to be a powerful tool in parallel algorithm design. Several students, undergraduate and graduate, will be involved in different aspects of this project.
Decipherability of Codes and Applications
NSF (Individual), National Science Foundation (RUI Theory of Computing), 19972000.
Equations on Varieties of Monoids
NSF (Individual), National Science Foundation (RUI Theory of Computing), 19931996.
The Decidability Problem of the DotDepth Hierarchy
NSF (Individual), National Science Foundation (RUI Theory of Computing), 19911993.