|

|

|

|

|

|

Book

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

Book Chapter

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, 2007, pp 11--58.

Please reference the following related papers and the respective project websites, if applicable.

1. Emily Allen, F. Blanchet-Sadri, Cameron Byrum, Mihai Cucuringu and Robert Mercas, “Counting bordered partial words by critical positions.”
   
   
2. J. Berstel and L. Boasson, “Partial words and a theorem of Fine and Wilf,” Theoretical Computer Science, Vol. 218, 1999, pp 135-141.
   
   
3. Brandon Blakely, F. Blanchet-Sadri, Josh Gunter and Narad 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, Stutgart, Germany Lecture Notes in Computer Science, Vol. 5583, Springer-Verlag, Berlin Heidelberg, 2009, pp 113-124.
   
   
4. F. Blanchet-Sadri, “Periodicity on partial words,” Computers and Mathematics with Applications, Vol. 47, 2004, pp 71-82.
   
   
5. F. Blanchet-Sadri, “Codes, orderings, and partial words,” Theoretical Computer Science, Vol. 329, 2004, pp 177-202.
   
   
6. F. Blanchet-Sadri, “Primitive partial words,” Discrete Applied Mathematics, Vol. 148, 2005, pp 195-213.
   
   
7. F. Blanchet-Sadri, Emily Allen, Cameron Byrum, Mihai Cucuringu and Robert Mercas, “Counting distinct partial words,” International Conference on Automata, Languages and Related Topics, Debrecen, Hungary, October 21-24, 2008.
   
   
8. F. Blanchet-Sadri, Emily Allen, Cameron Byrum and Robert 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, Tarragona, Spain, Lecture Notes in Computer Science, Vol. 5457, Springer-Verlag, Berlin, Heidelberg, 2009, pp 176-187.
   
   
9. F. Blanchet-Sadri, Emily Allen and John Lensmire, “On counting unbordered partial words with two holes.”
   
   
10. F. Blanchet-Sadri and Arundhati R. Anavekar, “Testing primitivity on partial words,” Discrete Applied Mathematics, Vol. 155, 2007, pp 279-287.
    
    
11. F. Blanchet-Sadri, Deepak Bal and Gautam Sisodia, “Graph connectivity, partial words, and a theorem of Fine and Wilf,” Information and Computation, Vol. 206, 2008, pp 676-693.
    
    
12. F. Blanchet-Sadri, D. Dakota Blair, and Rebeca V. Lewis, “Equations on partial words,” in R. Kralovic and P. Urzyczyn (Eds.), MFCS 2006, 31st International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 4162, Springer-Verlag, Berlin, Heidelberg, 2006, pp 167-178.
    
    
13. F. Blanchet-Sadri, D. Blair and R.V. Lewis, “Equations on partial words, ” RAIRO-Theoretical Informatics and Applications, Vol.43, 2009, pp 23-39.
    
    
14. F. Blanchet-Sadri, Brandon Blakely and Josh Gunter, “On avoidable two-element sets of partial words.”
    
    
15. F. Blanchet-Sadri, Brandon Blakeley, Josh Gunter, Sean Simmons and Eric Weissenstein, “An answer to a conjecture on two-element avoidable sets of partial words.”
    
    
16. F. Blanchet-Sadri, L. Bromberg and Karl 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.
    
    
17. F. Blanchet-Sadri, N.C. Brownstein, A. Kalcic, J. Palumbo and T. Weyand, “Unavoidable Sets of Partial Words,” Theory of Computing Systems, Vol. 45, 2009, pp 381-406.
    
    
18. F. Blanchet-Sadri, N.C. Brownstein and Justin 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, Turku, Finland, Lectures Notes in Computer Science, Vol. 4588, Springer-Verlag, Berlin, Heidelberg, 2007, pp 96-107.
    
    
19. F. Blanchet-Sadri, James Carraher and Brian Shirey, “Strong periods in partial words.”
    
    
20. F. Blanchet-Sadri, Bo Chen and Aleksandar Chakarov, “Minimum number of holes in unavoidable sets.”
    
    
21. F. Blanchet-Sadri, Ilkyoo Choi and Robert Mercas, “Avoiding large squares in partial words.”
    
    
22. F. Blanchet-Sadri and Ajay Chriscoe, “Local periods and binary partial words: an algorithm,” Theoretical Computer Science, Vol. 314, 2004, pp 189-216.
    
    
23. F. Blanchet-Sadri, E. Clader and O. Simpson, “Border Correlations of Partial Words,” Theory of Computing Systems, to appear.
    
    
24. F. Blanchet-Sadri, Kevin Corcoran and Jenell Nyberg, “Periodicity properties on partial words,”" Information and Computation, Vol. 206, 2008, pp 1057-1064.
    
    
25. F. Blanchet-Sadri, Michelle Cordier, Mihai Cucuringu and Rachel Kirsch, “Combinatorics on border correlations of partial words,” International Conference on Automata, Languages and Related Topics, Debrecen, Hungary, October 21-24, 2008.
    
    
26. F. Blanchet-Sadri and Mihai Cucuringu, “Counting primitive partial words.”
    
    
27. F. Blanchet-Sadri, C.D. Davis, Joel Dodge, Robert Mercas and Margaret Moorefield, “Unbordered Partial Words,” Discrete Applied Mathemartics, Vol. 157, 2009, pp 890-900.
    
    
28. 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.
    
    
29. F. Blanchet-Sadri, Justin Fowler, Joshua Gafni and Kevin Wilson, “Combinatorics on Partial Word Correlations.”
    
    
30. F. Blanchet-Sadri, Joshua Gafni and Kevin Wilson, “Correlations of partial words,” in W. Thomas and P. Weil (Eds.), STACS 2007, 24th International Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, Lecture Notes in Computer Science, Vol. 4393, Springer-Verlag, Berlin, Heidelberg, 2007, pp 97-108.
    
    
31. F. Blanchet-Sadri and Robert A. Hegstrom, “Partial words and a theorem of Fine and Wilf revisited,” Theoretical Computer Science, Vol. 270, 2002, pp 401-419.
    
    
32. F. Blanchet-Sadri, Raphael Jungers, and Justin Palumbo, “Testing avoidability of sets of partial words is hard,” Theoretical Computer Science, Vol. 410, 2009, pp 968-972.
    
    
33. F. Blanchet-Sadri, Jane Kim, Robert Mercas, William Severa and Sean Simmons, “Abelian square-free partial words.”
    
    
34. F. Blanchet-Sadri and D.K. Luhmann, “Conjugacy on partial words,” Theoretical Computer Science, Vol. 289, 2002, pp 297-312.
    
    
35. F. Blanchet-Sadri, Travis Mandel and Gautam Sisodia, “Computing Strong Periods in Partial Words.”
    
    
36. F. Blanchet-Sadri, Robert Mercas, Abraham Rashin and Elara 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, Tarragona, Spain, Lecture Notes in Computer Science, Vol. 5457, Springer-Verlag, Berlin, Heidelberg, 2009, pp 188-199.
    
    
37. F. Blanchet-Sadri, Robert Mercas and Geoffrey 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, Balatonfüred, Hungary, Proceedings, 2008, pp 122-133 (an extended version to appear in Acta Cybernetica).
    
    
38. F. Blanchet-Sadri, Robert Mercas and Geoffrey Scott, “A generalization of Thue Freeness for Partial Words,” Theoretical Computer Science, Vol. 410, 2009, pp 793-800.
    
    
39. F. Blanchet-Sadri and Robert Mercas, “A note on the number of squares in partial words with one hole,” RAIRO-Theoretical Informatics and Applications, to appear.
    
    
40. F. Blanchet-Sadri, Robert Mercas and Kristen Wetzler, “The three-squares lemma for partial words with one hole,” WORDS 2009, the 7th International Conference on Words, September 14-18, 2009, Salerno, Italy.
    
    
41. F. Blanchet-Sadri and Margaret Moorefield, “Pcodes of partial words.”
    
    
42. F. Blanchet-Sadri, Taktin Oey and Timothy 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, Balatonfüred, Hungary, Proceedings, 2008, pp 134-145 (an extended version to appear in International Journal of Foundations of Computer Science).
    
    
43. F. Blanchet-Sadri, Jarett Schwartz and Slater Stich, “Partial subword complexity.”
    
    
44. F. Blanchet-Sadri, Jarett Schwartz and Slater Stich, “Representable sets and recurrent partial words.”
    
    
45. F. Blanchet-Sadri, Jarett Schwartz and Slater Stich, “De Brujin partial words.”
    
    
46. F. Blanchet-Sadri and Brian Shirey, “Periods and binary partial words,” WORDS 2009, the 7th International Conference on Words, September 14-18, 2009, Salerno, Italy.
    
    
47. F. Blanchet-Sadri, Sean Simmons and Eric Weissenstein, “Avoidable patterns in partial words.”
    
    
48. F. Blanchet-Sadri, Amelia Tebbe and Amy Veprauskas, “Abelian periods on partial words.”
    
    
49. F. Blanchet-Sadri and Nathan D. Wetzler, “Partial words and the critical factorization theorem revisited,” Theoretical Computer Science, Vol. 385, 2007, pp 179-192.
    
    
50. J. Karhumäki, Y. Lifshits and W. Rytter, “Tiling periodicity.” CPM 2007, 18th Annual Symposium on Combinatorial Pattern Matching.
    
    
51. Gerhard Lischke, “Restorations of punctured languages and similarity of languages.” Mathematical Logic Quarterly, Vol. 52, 2006, pp 20-28.
    
    
52. F. Manea and Robert Mercas, “Freeness of partial words,” Theoretical Computer Science, Vol. 389, 2007, pp 265-277.
    
    
53. A.M. Shur and Y.V. Gamzova, “Partial words and the periods' interaction property.” Izvestya RAN 68, 2004, pp 199-222.
    
    

The following publications are suggested for developing a background in combinatorics on words.

1. J.P. Allouche and J. Shallit, Automatic Sequences: Theory, Applications, Generalizations, Cambridge University Press, Cambridge, 2003.
   
   
2. J. Berstel and D. Perrin, Theory of Codes, Academic Press, Orlando, FL, 1985.
   
   
3. C. Choffrut, J. Karhumaki, “Combinatorics of Words,” in G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 1, Ch. 6, Springer-Verlag, Berlin, 1997, pp 329-438.
   
   
4. M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, New York, NY, 1994.
   
   
5. M. Crochemore and W. Rytter, Jewels of Stringology, World Scientific, NJ, 2003.
   
   
6. A. de Luca and S. Varricchio, “Regularity and Finiteness Conditions,” in G. Rozenberg and A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 1, Ch. 11, Springer-Verlag, Berlin, 1997, pp 747-810.
   
   
7. A. de Luca and S. Varricchio, Finiteness and Regularity in Semigroups and Formal Languages, Springer-Verlag, Berlin, 1999.
   
   
8. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge University Press, Cambridge, 1997.
   
   
9. M. Lothaire, Combinatorics on Words, Addison-Wesley, Reading, MA, 1983 and Cambridge University Press, Cambridge, 1997.
   
   
10. M. Lothaire, Algebraic Combinatorics on Words, Cambridge University Press, Cambridge, 2002.
    
    
11. M. Lothaire, Applied Combinatorics on Words, Cambridge University Press, Cambridge, 2005.
    
    
12. J. Setubal and J. Meidanis, Introduction to Computational Molecular Biology, PWS Publishing Company, Boston, MA, 1997.
    
    
13. H.J. Shyr, Free Monoids and Languages, Hon Min Book Company, Taichung, Taiwan, 1991.
    
    

These listed websites provide helpful information regarding the LaTeX document preparation system.

• the LaTeX project home page
  
  
• Beginner's tutorial by Tobias Oetiker, The (Not So) Short Introduction to LaTeX2e
  
  
• MiKTeX project, a TeX implementation for the Windows operating system
  
  

The websites below offer general information regarding web page development and html.

• beginner's introduction to html
  
  
• an advanced html tutorial
  
  
• a reference for math symbols in html
  
  
• a tutorial for programming CGI in C++
  
  

The following website is provided for assistance in creating effective Beamer presentations.

• a general Beamer tutorial
  
  

These books are strongly recommended as references for proper composition of papers of a mathematical nature.

• N.J. Higham, Handbook of Writing for the Mathematical Sciences, Siam, Philadelphia, PA, 1993.
  
  
• D.E. Knuth, T. Larrabee and P.M. Roberts, Mathematical Writing, MAA Notes Number 14, 1989.
  
  

The following organizations are essential means of support and development promotion.

• Association for Computing Machinery, ACM
  
  
• IEEE Computer Society, IEEE CS
  
  
• IEEE Technical Committee on Mathematical Foundations of Computing, IEEE TCMF
  
  
• American Mathematical Society, AMS
  
  
• Mathematical Association of America, MAA
  
  
• International Society for Computational Biology, ISCB
  
  
• Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory, ACM SIGACT
  
  
• Society for Industrial and Applied Mathematics, SIAM
  
  

These conferences are crucial to the discussion and exchange of competitive ideas.

• AFL International Conference on Automata and Formal Languages, AFL
  
  
• ACM Symposium on Theory of Computing, STOC
  
  
• Symposium on Foundations of Computer Science, FOCS
  
  
• International Colloquium on Automata, Languages, and Programming, ICALP
  
  
• ACM-SIAM Symposium on Discrete Algorithms, SODA
  
  
• Symposium on Theoretical Aspects of Computer Science, STACS
  
  
• Latin American Theoretical Informatics Symposium, LATIN
  
  
• Mathematical Foundations of Computer Science, MFCS
  
  
• International Conference on Words, WORDS
  
  
• International Conference on Developments in Language Theory, DLT
  
  
• International Colloquium on Theoretical Aspects of Computing, ICTAC
  
  
• Society for Industrial and Applied Mathematics Conference on Discrete Mathematics, SIAM
  
  
• International Conference on Language and Automata Theory and Applications, LATA
  
  
• Fundamentals of Computation Theory, FCT
  
  

The following journals provide a wealth of information, both historic and current, regarding the subject focus area and are vital communication media.

• Communications of the ACM, CACM
  
  
• Computers and Mathematics with Applications
  
  
• Discrete Applied Mathematics: Combinatorial Algorithms, Informatics, and Computational Sciences
  
  
• Discrete Mathematics
  
  
• Information and Computation
  
  
• International Journal of Foundations of Computer Science, IJFCS
  
  
• Journal of Algorithms
  
  
• Journal of Automata, Languages, and Combinatorics
  
  
• Journal of Combinatorial Theory, Series A
  
  
• Journal of the Association for Computing Machinery, JACM
  
  
• SIAM Journal on Computing
  
  
• SIAM Journal on Discrete Mathematics
  
  
• Theoretical Informatics and Applications, an international journal on theoretical computer science and its applications
  
  
• Theoretical Computer Science
  
  
• Theory of Computing Systems