Resources




Project Home
Application
Contact Information
UNCG campus and Greensboro, NC Information
Summer 2005 Information
Summer 2006 Information
Summer 2007 Information
Summer 2008 Information
Summer 2009 Information
Summer 2010 Information
Summer 2011 Information
Summer 2012 Information
Summer 2013 Information
Summer 2014 Information
Summer 2015 Information
Summer 2016 Information
Relevant Papers | Recommended Literature | Latex Guidance | HTML Assistance
Beamer Advice | Technical Writing | Organizations
Conferences | Journals



Books

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.

Relevant Papers

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

  1. E. Allen, F. Blanchet-Sadri, C. Byrum, M. Cucuringu and R. Mercas, “Counting bordered partial words by critical positions,” The Electronic Journal of Combinatorics, Vol. 18, 2011, #P138.

  2. E. Balkanski, F. Blanchet-Sadri, M. Kilgore and B. Wyatt, “Partial Word DFAs.” In S. Konstantinidis (Ed.), CIAA 2013, 18th International Conference on Developments in Language Theory, July 16-19, 2013, Halifax, Nova Scotia, Canada, Lecture Notes in Computer Science, Vol. 7982, Springer-Verlag, Berlin, Heidelberg, 2013, pp 36-47.

  3. J. Berstel and L. Boasson, “Partial words and a theorem of Fine and Wilf,” Theoretical Computer Science, Vol. 218, 1999, pp 135-141.

  4. B. Blakely, 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, Stuttgart, Germany, Lecture Notes in Computer Science, Vol. 5583, Springer-Verlag, Berlin Heidelberg, 2009, pp 113-124 (expanded version in Theoretical Computer Science, Vol. 411, 2010, pp 4263-4271).

  5. F. Blanchet-Sadri, “Periodicity on partial words,” Computers and Mathematics with Applications, Vol. 47, 2004, pp 71-82.

  6. F. Blanchet-Sadri, “Codes, orderings, and partial words,” Theoretical Computer Science, Vol. 329, 2004, pp 177-202.

  7. F. Blanchet-Sadri, “Open problems on avoidable patterns in partial words,” in P. Dömösi and Sz. Iván (Eds.), AFL 2011, 13th International Conference on Automata and Formal Languages, August 17-22, 2011, Debrecen, Hungary, Proceedings, pp 12-24 (Invited Paper).

  8. F. Blanchet-Sadri, “Primitive partial words,” Discrete Applied Mathematics, Vol. 148, 2005, pp 195-213.

  9. 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).

  10. F. Blanchet-Sadri, E. Allen, C. Byrum, M. Cucuringu and R. Mercas, “Counting distinct partial words,” International Conference on Automata, Languages and Related Topics, Debrecen, Hungary, October 21-24, 2008.

  11. 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, Tarragona, Spain, Lecture Notes in Computer Science, Vol. 5457, Springer-Verlag, Berlin, Heidelberg, 2009, pp 176-187.

  12. F. Blanchet-Sadri, E. Allen and J. Lensmire, “On counting unbordered partial words with two holes.”

  13. 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.

  14. F. Blanchet-Sadri and A. R. Anavekar, “Testing primitivity on partial words,” Discrete Applied Mathematics, Vol. 155, 2007, pp 279-287.

  15. 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.

  16. 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, Lecture Notes in Computer Science, Vol. 6638, Springer-Verlag, Berlin, Heidelberg, 2011, pp 155-166.

  17. 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, Lecture Notes in Computer Science, Vol. 4162, Springer-Verlag, Berlin, Heidelberg, 2006, pp 167-178.

  18. F. Blanchet-Sadri, D. Blair and R.V. Lewis, “Equations on partial words,” RAIRO-Theoretical Informatics and Applications, Vol. 43, 2009, pp 23-39.

  19. 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, Bilbao, Spain, Lectures Notes in Computer Science, Springer-Verlag, Berlin, Heidelberg, 2013, to appear.

  20. 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.

  21. 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.

  22. 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, Turku, Finland, Lectures Notes in Computer Science, Vol. 4588, Springer-Verlag, Berlin, Heidelberg, 2007, pp 96-107.

  23. F. Blanchet-Sadri, J. Carraher and B. Shirey, “Strong periods in partial words.”

  24. F. Blanchet-Sadri, A. Chakarov and B. Chen, “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-55.

  25. F. Blanchet-Sadri, A. Chakarov and B. Chen, “Number of holes in unavoidable sets of partial words I,” Journal of Discrete Algorithms, Vol. 14, 2012, pp 55-64.

  26. 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.

  27. 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.

  28. F. Blanchet-Sadri, I. Choi and R. Mercas, “Avoiding large squares in partial words,” Theoretical Computer Science, Vol. 412, 2011, pp 3752-3758.

  29. F. Blanchet-Sadri and A. Chriscoe, “Local periods and binary partial words: an algorithm,” Theoretical Computer Science, Vol. 314, 2004, pp 189-216.

  30. F. Blanchet-Sadri, E. Clader and O. Simpson, “Border correlations of partial words,” Theory of Computing Systems, Vol. 47, 2010, pp 179-195.

  31. F. Blanchet-Sadri, K. Corcoran and J. Nyberg, “Periodicity properties on partial words,” Information and Computation, Vol. 206, 2008, pp 1057-1064.

  32. F. Blanchet-Sadri, M. Cordier, M. Cucuringu and R. Kirsch, “Combinatorics on border correlations of partial words,” International Conference on Automata, Languages and Related Topics, Debrecen, Hungary, October 21-24, 2008.

  33. F. Blanchet-Sadri and M. Cucuringu, “Counting primitive partial words,” Journal of Automata, Languages and Combinatorics, to appear.

  34. 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.

  35. F. Blanchet-Sadri, B. De Winkle and S. Simmons, “Abelian pattern avoidance in partial words,” RAIRO-Theoretical Informatics and Applications, to appear.

  36. 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”).

  37. F. Blanchet-Sadri, J. Fowler, J. Gafni and K. Wilson, “Combinatorics on partial word correlations,” Journal of Combinatorial Theory, Series A, Vol. 117, 2010, pp 607-624.

  38. F. Blanchet-Sadri and N. Fox, “Abelian-Primitive Partial words”. Theoretical Computer Science, Vol. 485, 2013, pp 16-37.

  39. 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.

  40. F. Blanchet-Sadri, J. Gafni and K. 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.

  41. F. Blanchet-Sadri and R. A. Hegstrom, “Partial words and a theorem of Fine and Wilf revisited,” Theoretical Computer Science, Vol. 270, 2002, pp 401-419.

  42. 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.

  43. 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.

  44. F. Blanchet-Sadri, R. Jungers and J. Palumbo, “Testing avoidability of sets of partial words is hard,” Theoretical Computer Science, Vol. 410, 2009, pp 968-972.

  45. F. Blanchet-Sadri, J. 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.

  46. F. Blanchet-Sadri, J. I. Kim, R. Mercas, W. Severa, S. Simmons and D. Xu, “Avoiding abelian squares in partial words,” Journal of Combinatiorial Theory, Series A, Vol. 119, 2012, pp 257-270.

  47. 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, Springer-Verlag, Berlin, Heidelberg, 2013, to appear.

  48. 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.

  49. F. Blanchet-Sadri and J. Lensmire, “On Minimal Sturmian Partial Words,” Discrete Applied Mathematics, Vol. 159, No. 8, 2011, pp 733-745.

  50. 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.

  51. F. Blanchet-Sadri and D.K. Luhmann, “Conjugacy on partial words,” Theoretical Computer Science, Vol. 289, 2002, pp 297-312.

  52. 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.

  53. F. Blanchet-Sadri, T. Mandel and G. Sisodia, “Periods in Partial Words: An Algorithm.” Journal of Discrete Algorithms, Vol. 16, 2012, pp 113-128.

  54. F. Blanchet-Sadri and R. Mercas, “A note on the number of squares in partial words with one hole,” RAIRO-Theoretical Informatics and Applications, Vol. 43, 2009, pp 767-774.

  55. 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, Tarragona, Spain, Lecture Notes in Computer Science, Vol. 5457, Springer-Verlag, Berlin, Heidelberg, 2009, pp 188-199.

  56. 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.

  57. 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, Balatonfüred, Hungary, Proceedings, 2008, pp 122-133.

  58. F. Blanchet-Sadri, R. Mercas and G. Scott, “Counting distinct squares in partial words,” Acta Cybernetica, Vol. 19, 2009, pp 465-477.

  59. 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.

  60. 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.

  61. 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).

  62. F. Blanchet-Sadri, R. Mercas and K. 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.

  63. 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.

  64. F. Blanchet-Sadri and M. Moorefield, “Pcodes of partial words.”

  65. F. Blanchet-Sadri and S. Munteanu, “Deciding Representability of Words of Equal Length in Polynomial Time.” In T. Lecroq and L. Mouchard (Eds.), IWOCA 2013, 24th International Workshop on Combinatorial Algorithms, July 10-12, 2013, Rouen, France, Lecture Notes in Computer Science, Vol. 8288, Springer-Verlag, Berlin, Heidelberg, 2013, to appear.

  66. F. Blanchet-Sadri, S. Nelson and A. Tebbe, “On operations preserving primitivity of partial words with one hole,” in P. Dömösi and Sz. Iván (Eds.), AFL 2011, 13th International Conference on Automata and Formal Languages, August 17-22, 2011, Debrecen, Hungary, Proceedings, pp 93-107.

  67. 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, Balatonfüred, Hungary, Proceedings, 2008, pp 134-145.

  68. 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, 705-722.

  69. F. Blanchet-Sadri, J. Schwartz, S. Stich and B. J. Wyatt, “Binary de Brujin 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.

  70. F. Blanchet-Sadri and B. Shirey, “Periods and binary partial words,” WORDS 2009, 7th International Conference on Words, September 14-18, 2009, Salerno, Italy.

  71. 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, 2011p Milano, Italy, Lecture Notes in Computer Science, Vol. 6795, Springer-Verlag, Berlin, Heidelberg, 2011, pp 70-81.

  72. 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 (expanded version to appear in Theoretical Computer Science).

  73. 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.

  74. F. Blanchet-Sadri, S. Simmons and D. Xu, “Abelian repetitions in partial words,” Advances in Applied Mathematics, Vol. 48, 2012, pp 194-214.

  75. 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.

  76. 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.

  77. F. Blanchet-Sadri and N. D. Wetzler, “Partial words and the critical factorization theorem revisited,” Theoretical Computer Science, Vol. 385, 2007, pp 179-192.

  78. 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 94-105.

  79. F. Blanchet-Sadri and B. Woodhouse, “Strict Bounds for Pattern Avoidance.” Theoretical Computer Science, Vol. 506, 2013, pp 17-28.

  80. G. Lischke, “Restorations of punctured languages and similarity of languages,” Mathematical Logic Quarterly, Vol. 52, 2006, pp 20-28.

  81. F. Manea and Robert Mercas, “Freeness of partial words,” Theoretical Computer Science, Vol. 389, 2007, pp 265-277.

  82. A.M. Shur and Y.V. Gamzova, “Partial words and the periods’ interaction property.” Izvestya RAN 68, 2004, pp 199-222.

Return to Menu



Recommended Literature
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, C. Hancart and T. Lecroq, Algorithmique du texte, Vuibert, 2001.

  5. M. Crochemore, C. Hancart and T. Lecroq, Algorithms on Strings, Cambridge University Press, New York, NY, 2007.

  6. M. Crochemore and W. Rytter, Jewels of Stringology, World Scientific, NJ, 2003.

  7. M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, New York, NY, 1994.

  8. A. de Luca and S. Varricchio, Finiteness and Regularity in Semigroups and Formal Languages, Springer-Verlag, Berlin, 1999.

  9. A. de Luca and S. Varricchio, “Regularity and Finiteness Conditions,” in G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 1, Ch. 11, Springer-Verlag, Berlin, 1997, pp 747-810.

  10. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge University Press, Cambridge, 1997.

  11. M. Lothaire, Algebraic Combinatorics on Words, Cambridge University Press, Cambridge, 2002.

  12. M. Lothaire, Applied Combinatorics on Words, Cambridge University Press, Cambridge, 2005.

  13. M. Lothaire, Combinatorics on Words, Addison-Wesley, Reading, MA, 1983 and Cambridge University Press, Cambridge, 1997.

  14. J. Setubal and J. Meidanis, Introduction to Computational Molecular Biology, PWS Publishing Company, Boston, MA, 1997.

  15. H.J. Shyr, Free Monoids and Languages, Hon Min Book Company, Taichung, Taiwan, 1991.

Return to Menu



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

Return to Menu



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

Return to Menu



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

Return to Menu



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

Return to Menu



Organizations
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

Return to Menu



Conferences
These conferences are crucial to the discussion and exchange of competitive ideas.
  • ACM-SIAM Symposium on Discrete Algorithms, SODA

  • ACM Symposium on Theory of Computing, STOC

  • AFL International Conference on Automata and Formal Languages, AFL

  • Fundamentals of Computation Theory, FCT

  • International Colloquium on Automata, Languages, and Programming, ICALP

  • International Conference on Developments in Language Theory, DLT

  • International Conference on Language and Automata Theory and Applications, LATA

  • International Conference on Words, WORDS

  • International Workshop on Combinatorial Algorithms, IWOCA

  • International Workshop on Descriptional Complexity of Formal Systems, DCFS

  • Journees Montoises d'Informatique Theorique, JM

  • Latin American Theoretical Informatics Symposium, LATIN

  • Mathematical Foundations of Computer Science, MFCS

  • Society for Industrial and Applied Mathematics Conference on Discrete Mathematics, SIAM

  • Symposium on Foundations of Computer Science, FOCS

  • Symposium on Theoretical Aspects of Computer Science, STACS

  • Theory and Applications of Models of Computation, TAMC

  • Implementation and Application of Automata, CIAA

Return to Menu



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

Return to Menu