
"Algorithmic Combinatorics on Partial Words" by Francine BlanchetSadri, Chapman&Hall/CRC Press 2008.
The tutorial Preliminaries on Partial
Words by Dr. Francine BlanchetSadri is available.
The powerpoint presentation entitled Basic
XHTML and CSS by Margaret Moorefield is available.
The LaTeX
Tutorial by Stephanie Rednour and Robert Misior is
available.
The Beamer
Tutorial by Charles T. Batts is
available.
For a detailed account of a specific week, click on the week number.
Week 1

Orientation, Preliminaries on Partial Words, Presentation of Research Topics,
Team creation, Team meetings

Week 2

LaTeX tutorial, Team meetings, Technical writing 
Week 3 
XHTML and CSS tutorial, Team meetings, Review of papers

Week 4 
Team meetings, Initial presentations

Week 5 
Team meetings, Applet creation

Week 6 
Team meetings, NSF tutorial, Tshirt creation

Week 7 
Beamer tutorial, Team meetings

Week 8 
Team meetings, Final presentations 

Bob Chen
University of California San Diego


Sean Simmons
Massachusetts Institute of Technology


Brian Bowers
Clemson University


Matthew Chao
Rutgers, the State University of New Jersey


Nathan Fox
University of Minnesota  Twin Cities


Yang Jiao
University of Pennsylvania


Andrew Lohr
University of Maryland, College Park


John Machacek
University of Minnesota  Twin Cities


Sinziana Munteanu
Princeton University


Jennifer Paykin
Wesleyan University


Shane Scott
Kansas State University


Chloe Stevens
Swarthmore College


Lauren Won
University of Maryland, Baltimore County

Papers and Websites

F. BlanchetSadri, Brian Bowers and Nathan Fox, “Borders and Patterns in
Partial words.”

F. BlanchetSadri and Nathan Fox, “AbelianPrimitive
Partial words”. Theoretical Computer Science, Vol. 485, 2013, pp 1637.

F. BlanchetSadri, Matthew Chao and Lauren Won,
“Avoiding Abelian Fifth Powers in Binary Partial Words.”

F. BlanchetSadri, Bob Chen and Sinziana Munteanu,
“Recurrence in Infinite Partial Words.”
Theoretical Computer Science, Vol. 524, 2014, pp 4147.

F. BlanchetSadri, Bob Chen and Sinziana Munteanu,
“A Note on Constructing Infinite Binary Words with Polynomial Subword Complexity.” RAIROTheoretical Informatics
and Applications, Vol. 47, 2013, pp 195199.

F. BlanchetSadri, Yang Jiao and John 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, Andrew Lohr and Shane 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,
India, Lecture Notes in Computer Science, Vol. 7643, SpringerVerlag, Berlin, Heidelberg, 2012, pp 206218.

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, Jennifer Paykin and Chloe Stevens,
“Abelian Complexity of Partial Words.”

F. BlanchetSadri and Sean 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 (expanded version
in Theoretical Computer Science, Vol. 475, 2013, pp 3446).

F. BlanchetSadri and Sean Simmons,
“Counting Minimal SemiSturmian Words.” Discrete Applied Mathematics, Vol. 161, 2013, pp 28512861.

F. BlanchetSadri,
“Algorithmic Combinatorics on Partial Words.”
Journal of Foundations of Computer Science, Vol. 23, No. 6, 2012, pp 11891206 (invited paper).
Honors

Brian Bowers won an Honorable Mention for the Graduate Research Fellowship Competition of the National Science Foundation in 2012.

Jennifer Paykin won a Graduate Research Fellowship from the National Science Foundation in 2013.
Presentations

F. BlanchetSadri, “Algorithmic Combinatorics on Partial Words,”
AFL 2011, 13th International Conference on Automata and Formal Languages, Hungarian Academy of Sciences,
Debrecen, Hungary, August 22, 2011
(onehour invited lecture).


F. BlanchetSadri, “Algorithmic Combinatorics on Partial Words,”
Old Dominion University, Electrical and Computer Engineering Department, Norfolk, Virginia, November 4, 2011 (invited talk).


Bob Chen, “Subword Languages of Infinite Partial Words,”
Joint Mathematics Meetings, Boston, MA, January 6, 2012 (joint work with F. BlanchetSadri, Lucas Manuelli, S. Munteanu, Jarett Schwartz and Slater
Stich).


Bob Chen, “Counting Minimal Sturmian Words,”
SIAM DM12, Conference on Discrete Mathematics,
Halifax, Nova Scotia, Canada, June 20, 2012
(work of F. BlanchetSadri and Sean Simmons).

Bob Chen presenting the paper “Counting Minimal Sturmian Words,” at the SIAM Conference on Discrete Mathematics,
Nova Scotia, Canada, June 20, 2012.


Bob Chen, “Recurrence in Infinite Partial Words,”
SIAM DM12, Conference on Discrete Mathematics,
Halifax, Nova Scotia, Canada, June 20, 2012
(joint work with F. BlanchetSadri and Sinziana Munteanu).

From left to right, Bob Chen, Laure Flapan and Steven Ji attending the SIAM Conference on Discrete Mathematics,
Halifax, Nova Scotia, Canada, from June 18 to June 21, 2012.


Shane Scott, “Computing the Partial Word Avoidability Indices of Ternary Patterns,”
IWOCA 2012, 23rd International Workshop on Discrete Algorithms,
Tamil Nadu, India, July 21, 2012
(joint work with F. BlanchetSadri and Andrew Lohr).

Shane Scott presenting the paper “Computing the Partial Word
Avoidability Indices of Ternary Patterns,” at the IWOCA International
Workshop on Combinatorial Algorithms, Tamil Nadu, India, July 21,
2012.

Shane Scott attending the IWOCA 2012 postconference tour.


F. BlanchetSadri, “Deciding Representability of Sets of Words of Equal Length,”
DCFS 2012, 14th International Workshop on Descriptional Complexity of Formal Systems,
Braga, Portugal, July 25, 2012
(joint work with Sean Simmons).


Yang Jiao, “Squares in Binary Partial Words,”
DLT 2012, 16th International Conference on Developments in Language Theory,
Taipei, Taiwan, August 17, 2012
(joint work with F. BlanchetSadri and John Machacek).

Yang Jiao presenting the paper “Squares in Binary Partial Words,” at
the DLT International Conference on Developments in Language Theory,
Taipei, Taiwan, August 17, 2012.

F. BlanchetSadri and Yang Jiao attending the DLT 2012 conference excursion.

Conferences

F. BlanchetSadri was invited to be a participant in the "Outstanding Challenges in Combinatorics on Words" workshop
that was held at the Banff International Research Station for Mathematical Innovation and Discovery from February 19 to 24, 2012.
Program Tshirt (artwork by Shane Scott)
