Areas of Interest
- Algebraic Theory of Languages and Automata
- String Algorithms
- Combinatorics on Words
- Discrete Mathematics
- Group and Semigroup Theory
- Logic
Society Memberships
- AMS American Mathematical Society
- ACM Association for Computing Machinery
- SIGACT Special Interest Group on Algorithms and Computation
Theory
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.
Selected Refereed Journals
- F. Blanchet-Sadri, "Games, Equations and the Dot-Depth Hierarchy."
International Journal of Computers and Mathematics with Applications, Vol. 18, No. 9, 1989, pp
809-822.
- F. Blanchet-Sadri, "On Dot-Depth Two." RAIRO-Theoretical Informatics and Applications, Vol. 24, No. 6, 1990, pp 521-529.
- F. Blanchet-Sadri, "Games, Equations and Dot-Depth Two Monoids." Discrete
Applied Mathematics, Vol. 39, No. 2, 1992, pp 99-111.
- F. Blanchet-Sadri, "The Dot-Depth of a Generating Class of Aperiodic
Monoids is Computable." International Journal of Foundations of Computer Science, Vol. 3, No.
4, 1992, pp 419-442.
- F. Blanchet-Sadri, "Equations and Dot-Depth One." Semigroup Forum,
Vo. 47, No. 3, 1993, pp 305-317.
- F. Blanchet-Sadri, "Equations and Monoid Varieties of Dot-Depth One
and Two." Theoretical Computer Science, Vol. 123, No. 2, 1994, pp 239-258.
- F. Blanchet-Sadri 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 67-81.
- F. Blanchet-Sadri, "On a Complete Set of Generators for Dot-Depth Two."
Discrete Applied Mathematics, Vol. 50, No. 1, 1994, pp 1-25.
- F. Blanchet-Sadri, "Equations on the Semidirect Product of a Finite
Semilattice by a J-trivial Monoid of Height k." RAIRO-Theoretical Informatics and Applications, Vol. 29, No. 3, 1995, pp 157-170.
- F. Blanchet-Sadri, "Some Logical Characterizations of the Dot-Depth
Hierarchy and Applications." Journal of Computer and System Sciences, Vol. 51, No.
2, 1995, pp 324-337.
- F. Blanchet-Sadri, "Inclusion Relations between some Congruences related
to the Dot-Depth Hierarchy." Discrete Applied Mathematics, Vol. 68, 1996,
pp 33-71.
- F. Blanchet-Sadri, "On Semidirect and Two-Sided Semidirect Products
of Finite J-trivial Monoids." RAIRO-Theoretical Informatics and Applications, Vo. 30, No. 5, 1996, pp 457-482.
- F. Blanchet-Sadri, "Equations on Semidirect Product of Commutative
Semigroups." Semigroup Forum, Vol. 55, No. 1, 1997, pp 80-88.
- F. Blanchet-Sadri, "On the Semidirect Product of the Pseudovariety
of Semilattices by a Locally Finite Pseudovariety of Groups." RAIRO-Theoretical Informatics and Applications, Vol. 31, No. 3, 1997, pp
237-250.
- F. Blanchet-Sadri and F.D. Gaddis, "On a Product of Finite Monoids."
Semigroup Forum, Vol. 57, 1998, pp 75-91.
- F. Blanchet-Sadri, "Trees, Congruences and Varieties of Finite Semigroups."
Discrete Applied Mathematics, Vol. 86, 1998, pp 157-179.
- F. Blanchet-Sadri and C. Morgan, "Multiset and Set Decipherable Codes."
International Journal of Computers and Mathematics with Applications, Vol. 41, No. 10/11, 2001,
pp 1257-1262.
- F. Blanchet-Sadri, "On Unique, Multiset, and Set Decipherability of
Three-Word Codes." IEEE Transactions on Information Theory, Vol. 47,
No. 5, 2001, pp 1745-1757.
- 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.
- F. Blanchet-Sadri and T. Howell, "Note on Decipherability of Three-Word
Codes." International Journal of Mathematics and Mathematical Sciences,
Vol. 30, No. 8, 2002, pp 491-504.
- F. Blanchet-Sadri and D.K. Luhmann, "Conjugacy on Partial Words."
Theoretical Computer Science, Vol. 289, No. 1, 2002, pp 297-312.
- F. Blanchet-Sadri, "A Periodicity Result of Partial Words with One
Hole." International Journal of Computers and Mathematics with Applications, Vol. 46, No. 5/6,
2003, pp 813-820.
- F. Blanchet-Sadri, "Periodicity on Partial Words." International Journal of Computers and
Mathematics with Applications, Vol. 47, No. 1, 2004, pp 71-82.
- F. Blanchet-Sadri and A. Chriscoe,
"Local Periods and Binary Partial Words: An Algorithm."
Theoretical Computer Science, Vol. 314, 2004, pp 189-216.
- F. Blanchet-Sadri, "Codes, Orderings, and Partial Words."
Theoretical Computer Science, Vol. 329, 2004, pp 177-202.
- 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").
- F. Blanchet-Sadri, "Primitive Partial Words."
Discrete Applied Mathematics, Vol. 148, 2005, pp 195-213.
- L. Zhang and F. Blanchet-Sadri,
"Algorithms for Approximate k-Covering of Strings."
International Journal of Foundations of Computer Science,
Vol. 16, No. 6, 2005, pp 1231-1251.
- F. Blanchet-Sadri and A.R. Anavekar,
"Testing Primitivity on Partial Words."
Discrete Applied Mathematics, Vol. 155, 2007, pp 279-287.
-
F. Blanchet-Sadri and N.D. Wetzler,
"Partial Words and the Critical Factorization Theorem
Revisited." Theoretical Computer Science, Vol. 385, 2007, pp 179-192.
-
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.
-
F. Blanchet-Sadri, K. Corcoran, and J. Nyberg, "Periodicity Properties on Partial
Words." Information and Computation, Vol. 206, 2008, pp 1057-1064.
- 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.
- F. Blanchet-Sadri, D. Blair and R.V. Lewis,
"Equations on Partial Words."
RAIRO-Theoretical Informatics and Applications, Vol. 43, 2009, pp 23-39.
-
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.
-
F. Blanchet-Sadri, R. Jungers and J. Palumbo,
“Testing Avoidability on Sets of Partial Words is Hard.” Theoretical
Computer Science, Vol. 410, 2009, pp 968-972.
- 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.
-
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.
-
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.
-
F. Blanchet-Sadri, R. Mercas and G. Scott,
“Counting Distinct Squares in Partial Words.” Acta Cybernetica, Vol. 19, 2009,
pp 465-477.
-
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.
- 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.
-
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, pp 705-722.
-
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.
-
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.
-
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).
-
F. Blanchet-Sadri and J. Lensmire, “On Minimal Sturmian Partial Words.” Discrete Applied Mathematics, Vol. 159, No. 8,
2011, pp 733-745.
-
F. Blanchet-Sadri, I. Choi and R. Mercas, “Avoiding Large Squares in Partial Words.” Theoretical Computer Science, Vol.
412, 2011, pp 3752-3758.
- 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.
-
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.
-
F. Blanchet-Sadri, S. Simmons and D. Xu, “Abelian Repetitions in Partial Words.” Advances in Applied
Mathematics, Vol. 48, 2012, pp 194-214.
- 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.
- 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.
-
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, 55-64.
-
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.
-
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.
-
F. Blanchet-Sadri, T. Mandel and G. Sisodia, “Periods in Partial
Words: An Algorithm.” Journal of Discrete Algorithms, Vol. 16, 2012, pp 113-128.
-
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).
-
F. Blanchet-Sadri and S. Simmons, “Deciding Representability of Sets of Words of Equal Length.” Theoretical
Computer Science, Vol. 475, 2013, pp 34-46.
-
F. Blanchet-Sadri and N. Fox, “Abelian-Primitive Partial Words.” Theoretical Computer Science,
Vol. 485, 2013, pp 16-37.
-
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.
-
F. Blanchet-Sadri, S. Simmons, A. Tebbe and A. Veprauskas, “Abelian Periods, Partial Words, and an Extension of a Theorem of Fine and Wilf.” RAIRO-Theoretical Informatics and
Applications, Vol. 47, 2013, pp 215-234.
-
F. Blanchet-Sadri and B. Woodhouse, “Strict Bounds for Pattern Avoidance.” Theoretical Computer Science, Vol. 506, 2013, pp 17-28.
-
F. Blanchet-Sadri and S. Simmons, “Counting Minimal Semi-Sturmian Words.” Discrete Applied Mathematics,
Vol. 161, 2013, pp 2851-2861.
-
F. Blanchet-Sadri, A. Lohr and S. Scott, “Computing the Partial Word Avoidablity Indices of Binary Patterns.” Journal of Discrete Algorithms, Vol. 23, 2013, pp
113-118.
-
F. Blanchet-Sadri, A. Lohr and S. Scott, “Computing the Partial Word Avoidablity Indices of Ternary Patterns.” Journal of Discrete Algorithms, Vol. 23, 2013, pp
119-142.
-
F. Blanchet-Sadri, B. Chen and S. Munteanu, “Recurrence in Infinite Partial Words.” Theoretical Computer Science, Vol. 524, 2014, 41-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.
-
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.
-
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.
-
F. Blanchet-Sadri, N. Fox and N. Rampersad, “On the Asymptotic Abelian Complexity of Morphic Words.” Advances in Applied Mathematics, Vol. 61, 2014, pp
46-84.
-
F. Blanchet-Sadri, M. Bodnar, J. Nikkel, J. D. Quigley and X. Zhang, “Squares and Primitivity in Partial Words.” Discrete Applied Mathematics, Vol. 185, 2015, pp 26-37.
-
E. Balkanski, F. Blanchet-Sadri, M. Kilgore and B. J. Wyatt, “On the State Complexity of Partial Word DFAs.” Theoretical Computer Science, Vol. 578, 2015, pp 2-12.
-
F. Blanchet-Sadri and A. Lohr, “Computing Minimum Length Representations of Sets of Words of Uniform Length.” Theoretical Computer Science, Vol. 596, 2015,
pp 41-54.
-
E. Allen, F. Blanchet-Sadri, M. Bodnar, B. Bowers, J. Hidakatsu and J. Lensmire, “Combinatorics on Partial Word Borders.” Theoretical Computer Science, Vol. 609, 2016, pp 469-493.
-
F. Blanchet-Sadri, D. Seita and D. Wise, “Computing Abelian Complexity of Binary Uniform Morphic Words.” Theoretical Computer Science, Vol. 640, 2016, pp
41-51.
-
F. Blanchet-Sadri and A. Lohr, “Computing Depths of Patterns.”
RAIRO-Theoretical Informatics and Applications, Vol. 50, 2016, pp 117-133.
-
F. Blanchet-Sadri, A. Chakarov, B. Chen, L. Manuelli, S. Munteanu, J. Schwartz and S. Stich, “Recurrent Partial Words and Representable Sets.”
Journal of Automata, Languages and Combinatorics,Vol. 21, 2016, pp 149-181.
-
F. Blanchet-Sadri, M. Bodnar and B. De Winkle, “New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings.”
Theory of Computing Systems, Vol. 60, 2017, pp 473-497.
-
F. Blanchet-Sadri and S. Munteanu, “Computing Generalized De Bruijn Sequences.”
Theoretical Computer Science, Vol. 704, 2017, pp 42-61.
-
F. Blanchet-Sadri, K. Goldner and A. Shackleton, “Minimal Partial Languages and Automata.” RAIRO-Theoretical Informatics and Applications, Vol. 51, No. 2, 2017, pp 99-119.
-
K. Black, F. Blanchet-Sadri, I. Coley, B. Woodhouse and A. Zemke, “Pattern Avoidance in Partial
Words Dense with Holes.” Journal of Automata, Languages and Combinatorics, Vol. 22, No. 4, 2017, pp 209-241.
-
F. Blanchet-Sadri, M. Cordier and R. Kirsch, “Border Correlations, Lattices, and the Subgraph Component Polynomial.”
European Journal of Combinatorics, Vol. 68, 2018, pp 204-222.
-
F. Blanchet-Sadri, J. Lazarow, J. Nikkel, J.D. Quigley and X. Zhang, “Computing Primitively-Rooted Squares and Runs in Partial Words.”
European Journal of Combinatorics, Vol. 68, 2018, pp 223-241.
-
F. Blanchet-Sadri and S. Osborne, “Computing Longest Common Extensions in Partial Words.”
Discrete Applied Mathematics, to appear.
Selected Refereed Conferences
-
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.
- 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.
-
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.
-
F. Blanchet-Sadri, 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 29-April 4, 2007, Tarragona, Spain, GRLMC Report 35/07, pp 115-126.
-
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.
-
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.
-
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.
-
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.
-
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.
- 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.
- 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.
-
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.
-
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.
-
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.
-
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.
-
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, pp 43-45.
- 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.
-
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.
-
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.
-
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.
-
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).
-
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.
- 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.
-
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.
-
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.
-
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.
-
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.
-
F. Blanchet-Sadri, 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 19-21, 2012, Tamil Nadu, India, Lecture Notes in Computer Science,
Vol. 7643, Springer-Verlag,
Berlin, Heidelberg, 2012, pp 206-218.
-
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.
-
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.
-
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.
-
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.
-
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'').
-
F. Blanchet-Sadri 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 10-12, 2013,
Rouen, France, Lecture Notes in Computer Science, Vol. 8288, Springer-Verlag,
Berlin, Heidelberg, 2013, pp 28-40.
-
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.
- F.
Blanchet-Sadri, 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 5-8, 2014, Lyon, France, LIPIcs Schloss Dagstuhl-Leibniz-Zentrum fur Informatik, Vol. 25, 2014, pp 162-173.
-
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.
-
F. Blanchet-Sadri and A. Lohr, “Computing Minimum Length Representations of Sets of Words of Uniform Length.” in
J. Kratochvil and M. Miller (Eds.), IWOCA 2014, 25th International Workshop on Combinatorial Algorithms, October 15-17, 2014,
Duluth, Minnesota, Lecture Notes in Computer Science, Vol. 8986, Springer International Publishing,
Switzerland, 2015, pp 74-85.
-
F. Blanchet-Sadri, J. Nikkel, J. D. Quigley, and X. Zhang, “Computing Primitively-Rooted Squares and Runs in Partial Words.” in
J. Kratochvil and M. Miller (Eds.), IWOCA 2014, 25th International Workshop on Combinatorial Algorithms, October 15-17, 2014,
Duluth, Minnesota, Lecture Notes in Computer Science, Vol. 8986, Springer International Publishing,
Switzerland, 2015, pp 86-97.
-
F. Blanchet-Sadri, M. Cordier and R. Kirsch, “Border Correlations, Lattices, and the Subgraph Component Polynomial.” in
J. Kratochvil and M. Miller (Eds.), IWOCA 2014, 25th International Workshop on Combinatorial Algorithms, October 15-17, 2014,
Duluth, Minnesota, Lecture Notes in Computer Science, Vol. 8986, Springer International Publishing, Switzerland, 2015, pp 62-73.
-
F. Blanchet-Sadri and A. Rashin, “Squareable Words.” in
I. Potapov (Ed.), DLT 2015, 19th International Conference on Developments in Language Theory, July 27-30, 2015,
Liverpool, United Kingdom, Lecture Notes in Computer Science, Vol. 9168, Springer International Publishing Switzerland,
2015, pp 132-142.
-
F. Blanchet-Sadri, R. Harred and J. Lazarow, “Longest Common Extensions in Partial Words.” in
Z. Liptak and W. F. Smyth (Eds.), IWOCA 2015, 26th International Workshop on Combinatorial Algorithms, October 5-7, 2015,
Verona, Italy, Lecture Notes in Computer Science, Vol. 9538, Springer International Publishing,
Switzerland, 2016, pp 52-64.
-
F. Blanchet-Sadri, K. Chen and K. Hawes, “Dyck Words, Lattice Paths, and Abelian Borders.” in
E. Csuhaj-Varju, P. Domosi and Gy. Vaszil (Eds.), AFL 2017, 15th International Conference on Automata and Formal Languages, September 4-6, 2017,
Debrecen, Hungary, Electronic Proceedings of Theoretical Computer Science, Vol. 252, 2017, pp 56-70.
-
J. Becker, F. Blanchet-Sadri, L. Flapan and S. Watkins, “Unavoidable Sets of Partial Words of Uniform Length.” in
E. Csuhaj-Varju, P. Domosi and Gy. Vaszil (Eds.), AFL 2017, 15th International Conference on Automata and Formal Languages, September 4-6, 2017,
Debrecen, Hungary, Electronic Proceedings of Theoretical Computer Science, Vol. 252, 2017, pp 26-40.
-
F. Blanchet-Sadri and S. Osborne, “Constructing Words with High Square Densities.” in
E. Csuhaj-Varju, P. Domosi and Gy. Vaszil (Eds.), AFL 2017, 15th International Conference on Automata and Formal Languages, September 4-6, 2017,
Debrecen, Hungary, Electronic Proceedings of Theoretical Computer Science, Vol. 252, 2017, pp 71-85.
Selected Talks
- Jeux, Equations, et Hierarchies d'Arbres, Laboratoire
d'Informatique Theorique et de Programmation, Universite Paris-VI,
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 2006-FIM XIII, Thirteenth International
Conference on Interdisciplinary Mathematical & Statistical
Techniques, New University of Lisbon-Tomar Polytechnic Institute,
Lisbon-Tomar, Portugal, 2006 (Plenary Talk).
- Algorithmic Combinatorics on Words, SCRA 2006-FIM XIII,
Thirteenth International Conference on Interdisciplinary Mathematical
& Statistical Techniques, New University of Lisbon-Tomar Polytechnic
Institute, Lisbon-Tomar, 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 21-24, 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 21-24, 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 Three-Squares 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 Mini-Conference on Discrete Mathematics and Algorithms, Clemson University, Department of Mathematics, Clemson, South
Carolina,
October 4, 2013 (Invited Talk).
- Pattern Occurrence Statistics and Applications to the Ramsey Theory of Unavoidable Patterns, DM14, SIAM Conference on Discrete Mathematics, Minneapolis, Minnesota,
June
19, 2014 (joint work with J. Tao).
Selected Research Grants
Repetitions in Strings
NSA (Individual), National Security Agency (Mathematical Sciences Program), 2015.
REU Site: Algorithmic Combinatorics on
Words 2011-2014
NSF (Individual), National Science Foundation (DMS Division of Mathematical Sciences), 2011-2014.
REU Site: Algorithmic Combinatorics on Words 2008-2011
NSF (Individual), National
Science Foundation (DMS Division of Mathematical Sciences), 2008-2011.
REU Site: Algorithmic Combinatorics on
Words
NSF (Individual), National Science Foundation (DMS Division of Mathematical Sciences), 2005-2008.
Computing Patterns in Strings
NSF (Individual), National Science Foundation (75% RUI Theory of Computing and 25% RUI Algebra, Number Theory, and Combinatorics), 2002-2005.
Decipherability of Codes and Applications
NSF (Individual), National
Science Foundation (RUI Theory of Computing), 1997-2000.
Equations on Varieties of Monoids
NSF (Individual), National Science
Foundation (RUI Theory of Computing), 1993-1996.
The Decidability Problem of the Dot-Depth Hierarchy
NSF (Individual), National Science Foundation (RUI Theory of Computing), 1991-1993.
Back to top