Talks

• Introduction to Walnut (with Manon Stipulanti), Discrete Mathematics and Computer Science Thematic Month, CIRM, Marseille, France, February 2024. Exercises and Solutions.
• Rudin-Shapiro Sums via Automata Theory and Logic, WORDS 2023, Umea, Sweden, June 2023.
• Using Walnut: Recent Results in Combinatorics on Words and Number Theory, CanaDAM 2023, Winnipeg, Manitoba, June 2023.
• Computer Proofs of some Combinatorial Congruences, Fields Institute Number Theory Seminar, January 2023.
• Ostrowski numeration and repetitions in words, One World Numeration Seminar, May 2020.
• Critical Exponents of Balanced Words, Words and Complexity, Lyon, France, February 2018.
• Decidable Properties of Automatic Sequences, Central Sectional Meeting of the American Mathematical Society, Minneapolis, Minnesota, October 2016.
• Computing Pi, University of Winnipeg Math Dialogue, February 2015.
• Some Properties of a Rudin-Shapiro-like sequence, Eastern Sectional Meeting of the American Mathematical Society, Halifax, Nova Scotia, October 2014.
• Avoiding Repetitions in Words, Part I, Part II, Part III, Computer Science E-Days 2014, Ekaterinburg, Russia.
• Repetitions in Words, Part I, Part II, Challenges in Combinatorics on Words 2013, Fields Institute, Toronto, Canada.
• Repetitions in Words, Part I, Part II, Part III, Part IV, Combinatorics, Automata, and Number Theory 2012, Marseille, France.
• Decidable Properties of Automatic Sequences, Summer Meeting of the Canadian Mathematical Society 2011, Edmonton, Alberta, 4 June 2011.
• Abstract Numeration Systems, LATA 2011, Tarragona, Spain, May 2011.
• Repetitions in Words: Classical and Recent Results, 13emes Journees Montoises D'Informatique Theorique, Amiens, France, 6 September 2010.
• The State Complexity of Testing Divisibility, DCFS 2010, Saskatoon, Saskatchewan, 8 August 2010.
• Non-Constructive Methods in Combinatorics on Words, Numeration 2010, Lorentz Center, Leiden, The Netherlands, 9 June 2010.
• The State Complexity of Testing Divisibility in Linear Numeration Systems, LIAFA, University of Paris 7, 4 June 2010.
• Non-Repetitive Sequence Games, Computer Science and Communications Research Unit, University of Luxembourg, 10 May 2010.
• Synchronizing Automata, Louvain School of Engineering, Catholic University of Louvain, 30 April 2010.
• Abelian Repetitions and Related Topics, CIRM, University of Aix-Marseille II, 6 April 2010.
• Repetitions in Words, Mathematics Institute of Luminy, University of Aix-Marseille II, 9 March 2010.
• Combinatorics on Words and Noncommutative Algebra, Department of Mathematics and Statistics, University of Winnipeg, 18 November 2009.
• Proving Dejean's Conjecture, Department of Computer Science, University of Manitoba, 29 October 2009.
• Recent Progress on Dejean's Conjecture, CORS/INFORMS International Meeting 2009, Toronto, Canada, 16 June 2009.
• Cerny's Conjecture, Department of Mathematics and Statistics, University of Winnipeg, 27 October 2008.
• Infinite Words Containing Squares at Every Position, 12emes Journees Montoises D'Informatique Theorique, Universite de Mons-Hainaut, Mons, Belgium, 27 August 2008.
• Combinatorics on Words: Applications to Number Theory and Ramsey Theory, Conference of the Prairie Network for Research in Mathematical Sciences, Brandon University, 9 May 2008.
• Automata, Palindromes, Powers, and Patterns. LATA 2008, Tarragona, Spain, 19 March 2008.
• Avoiding Approximate Squares. Algorithms Seminar, School of Computer Science, University of Waterloo, 13 June 2007.
• Paperfolding and Words Avoiding Repetitions. Algorithms Seminar, School of Computer Science, University of Waterloo, 8 November 2006.