Recent talks by Jeffrey O. Shallit

I grant readers of this page the right to reproduce one copy of any of these talks for the purposes of research and self-study.

2012
- Alf van der Poorten and continued fractions, talk for the Memorial Conference, March 13 2012
2011
- Short course on decidable properties of automatic sequences, University of Turku, Finland, November 2011 (4 hours)
- 50 Years of Fine and Wilf, invited talk for the Department of Mathematics, University of Turku, Finland, November 10 2011
- Short course on decidable properties of automatic sequences, FSFLA 2011, Tarragona, Spain, November 2011
- Fife's theorem for 7/3-powers, talk at WORDS 2011, Prague, September 15 2011
- The critical exponent is computable for automatic sequences, talk at WORDS 2011, Prague, September 12 2011
- Enumeration and decidable properties of automatic sequences, talk at DLT 2011, Milan, Italy, July 22 2011
- Fife's theorem revisited, talk at DLT 2011, Milan, Italy, July 22 2011
- 50 Years of Fine and Wilf, talk for the Waterloo Workshop in Computer Algebra (in honor of Herb Wilf's 80th birthday), May 26 2011
- The Frobenius Problem and Its Generalizations, talk at Tulane University, April 7 2011
- Introduction to Combinatorics on Words, talk for the Dagstuhl workshop, February 20-26, 2011
2010
- Enumeration of Automata, Languages, and Regular Expressions, invited talk for the "Highlights of AutomathA" conference, Vienna, Austria, November 23 2010
- The Separating Words Problem, talk at McMaster University, optimization seminar, September 27 2010
- Open Problems in Automata Theory and Formal Languages, talk for the Theory Colloquium, MIT, May 11 2010.
- The Frobenius Problem and Its Generalizations, talk for the MAA New York Meeting, May 1, 2010.
2009
- Universality and prefixes, suffixes, and factors, invited talk for the WORDS 2009 conference, September 15 2009, Salerno, Italy
- Periodicity and Repetitions in Automatic Sequences (invited talk for the minisymposium on Words at the 2nd Canadian Discrete and Algorithmic Mathematics Conference (CANADAM), May 27 2009)
- The Frobenius Problem and Its Generalizations (Queen's Distinguished Seminar Series)
2008
- The Frobenius Problem and Its Generalizations, talk at LIAFA in Paris, France, May 16 2008
- The Frobenius Problem and Its Generalizations, talk at the University of Arizona, Department of Computer Science, February 7, 2008.
2006
- The Ubiquitous Thue-Morse Sequence, Invited talk for the Research Experiences for Undergraduates program at University of North Carolina, Greensboro, July 14 2006.
- New Directions in State Complexity, Invited talk for the DCFS 2006 conference, June 22 2006.
- A series of 4 expository talks for the Summer School CANT (Combinatorics, Automata, and Number Theory) at the University of Liège, Belgium, May 8-12 2006.
2005
- William Dembski and Intelligent Design, 15-minute talk for the Interdisciplinary Coffee Talk Society at the University of Waterloo, November 1 2005
- My Favorite Open Problems in Words, invited talk for the Words 2005 conference.
2004
- Regular Expressions: Enumeration and State Complexity, invited talk for the Conference on Implementation and Application of Automata (CIAA), Kingston, Ontario, July 23 2004.
- Avoidability in Words: New Results and Open Problems, invited talk for the Workshop on Word Avoidability, Complexity and Morphisms (WACAM), Turku, Finland, July 17 2004.
2003
- New results on avoidability in words, talk for the Computer Science Department, University of Western Ontario, October 3 2003.
- New results on avoidability in words, talk for the Tutte Seminar, University of Waterloo, July 4 2003.
- Periodicity, morphisms, and matrices, talk for the number theory seminar, University of Waterloo, February 27 2003.
2002
- Talk at the DCFS 2002 conference (Descriptional Complexity of Formal Systems), London, Ontario.
  Regular Expressions: New Results and Open Problems
- Three talks at MathCamp, Colorado Springs, Colorado, July 29-August 2 2002.
- Formal Languages and Number Theory, Distinguished Lecture Series, University of Victoria, May 16, 2002.
2001
- Periodicity, Morphisms, and Matrices, talk for the theory seminar, Department of Computer Science, University of Arizona, November 7, 2001.
2000
- Can a Computer Think?, talk for the Kitchener-Waterloo-Cambridge-Guelph Humanists, November 20, 2000; 536 K Postscript file. Also see this Reading List.
- Morphisms, Matrices, and Periodicity, talk at the Winnipeg Combinatorial Mathematics Conference, September 30, 2000; 186K Postscript file.
- Number Theory and Formal Languages, talk at the Winnipeg Combinatorial Mathematics Conference, September 29, 2000; 178K Postscript file.
- k-regular Sequences, talk at the Colloquium in Honor of Michel Mendes France, Bordeaux, September 12, 2000; 124 K Postscript file.
- Algorithmic number theory before computers, talk at the workshop on Algorithmic Number Theory, Mathematical Sciences Research Institute, August 17, 2000.
- The greatest common divisor, talk at the workshop on Algorithmic Number Theory, Mathematical Sciences Research Institute, August 14, 2000.
- State complexity and Jacobsthal's function, talk at the CIAA '2000 Conference, London, Ontario, July 25, 2000; 264 K Postscript file.
- Ten Problems I Can't Solve, talk for the University of Waterloo Pure Math Club, July 11 2000; 1140 K Postscript file.
  Note: Problems 3 and 5 have been solved by Soroosh Yazdani and Sabin Cautis.
- The Uneasy Mix: Internet + Libraries, invited talk for the University of Waterloo Librarians Association, June 7 2000; 122 K Postscript file.
- Formal Languages and Number Theory, talk at AMS meeting, Notre Dame, April 8, 2000; 261 K Postscript file.
- Formal Languages and Number Theory, invited talk at International Colloquium on Automata, Languages, and Combinatorics, Kyoto, Japan, March 16, 2000.
- Formal Languages and Number Theory, invited talk at workshop on Unusual Applications of Number Theory, DIMACS, Rutgers University, January 14, 2000; 356 K Postscript file.
1999
- Automaticity and Rationality, slides for invited talk at Workshop on Descriptional Complexity of Automata, Grammars, and Related Structures, Magdeburg, Germany, July 22, 1999; 249 K Postscript file.
- Issues in Internet Regulation, slides for talk at Wilfrid Laurier University, March 23 1999; 104 K Postscript file.
- A Skeptic Looks at Christian Science, slides for talk for Freethought Waterloo, March 4 1999; 162 K Postscript file. You can also look at my longer version, A skeptical examination of Christian Science, and Five Questions Christian Scientists Can't Answer.
- Separating words with automata and grammars, talk for the University of Waterloo Algorithms and Complexity seminar, February 16 1999; 257 K Postscript file.
1998
- The Future of Free Speech in Cyberspace, talk at the Kitchener Public Library, February 23 1998; 109 K Postscript file.
1997
- Analysis of de Rooij's Algorithm for the Greatest Common Divisor of n Numbers, talk for the AMS meeting, Milwaukee, Wisconsin, October 25 1997; 172 K Postscript file.
- Regulating the Internet: National Necessity or Global Folly, talk for the conference Global Markets, Global Morals? at Wilfrid Laurier University, October 24 1997; 103 K Postscript file.
- Continued Fractions and Automatic Sequences, talk for the SAMS/AMS/SAMSA/LMS Joint Mathematics Conference, University of Pretoria, Pretoria, South Africa, June 27 1997; 210 K Postscript file.
- Number Theory and Formal Languages, talk for Number Theory Day, University of the Witwatersrand, Johannesburg, South Africa, June 25 1997; 189 K Postscript file.
1996
- Polynomial Automaticity, Context-Free Languages, and Fixed Points of Morphisms, talk for Mathematical Foundations of Computer Science (MFCS '96), Krakow, Poland, September 2 1996; 240 K Postscript file.
- Automaticity, plenary talk for the conference ``Emerging Applications of Number Theory'' at the Institute for Mathematics and Its Applications (IMA), Minneapolis, MN, July 23 1996; 249 K Postscript file.
- Continued Fractions and Automatic Sequences, talk for the 8th SIAM Conference on Discrete Mathematics, Minisymposium on Automatic Sequences, June 17 1996; 209 K Postscript file.
- Automaticity, talk at the University of Western Ontario, June 5 1996; 231 K Postscript file.
- The real meaning of free speech in cyberspace, talk for the conference "The Internet: Beyond the Year 2000", University of Toronto, Canada, May 1 1996.
- Discovery of a lost factoring machine, talk for the American Mathematical Society, Orlando, FL, January 13 1996; 115 K Postscript file.
1995
- Remarks on Inferring Integer Sequences, talk for the Canadian Mathematical Society, Vancouver, BC, December 11 1995; 306 K Postscript file.

E-mail: