| Your time | Speaker | Title | |
| Tue | Nov 19 | 14:00 | Léo Vivion | Balancedness constants of words generated by billiards in the hypercube | |
| Tue | Nov 05 | 14:00 | Benjamin Hellouin de Menibus | String attractors for infinite words | |
| Tue | Oct 22 | 13:00 | Olivier Carton | Mahler equations for Zeckendorf numeration | |
| Tue | Oct 08 | 13:00 | Mehdi Golafshan | Factor complexity of the most significant digits and unipotent dynamics on a torus | |
| Tue | Sep 24 | 13:00 | Luke Schaeffer | Summation and transduction of automatic sequences | |
| Tue | Sep 10 | 13:00 | Jia-Yan Yao | When is an automatic number transparent? | |
| Tue | Jul 09 | 13:00 | Jamie Simpson | Palindromic Periodicities | |
| Tue | Jun 25 | 13:00 | Julien Cassaigne | The Heinis spectrum | |
| Tue | Jun 11 | 13:00 | Markus Whiteland | What I know about Parikh-collinear morphisms | |
| Tue | May 28 | 13:00 | Pascal Ochem | Characterization of morphic words | |
| Tue | May 14 | 13:00 | Josef Rukavicka | Restivo Salemi property for $\alpha$-power free languages with $\alpha \geq 5$ and $k \geq 3$ letters | |
| Tue | Apr 30 | 13:00 | Michael Baake | Hats, CAPs and Spectres | |
| Tue | Apr 16 | 13:00 | Radoslaw Piórkowski | Universal quantification in automatic structures — an ExpSpace-hard nut to crack | |
| Tue | Apr 02 | 13:00 | John Campbell | On the evaluation of infinite products involving automatic sequences | |
| Tue | Mar 19 | 14:00 | Cor Kraaikamp | An introduction to $N$ -expansions with a finite set of digits | |
| Tue | Mar 05 | 14:00 | Finn Lidbetter | Improved bound for the Gerver-Ramsey collinearity problem | |
| Tue | Feb 20 | 14:00 | Christopher Cabezas | Large normalizer of odometers and higher-dimensional automatic sequences | |
| Tue | Feb 06 | 14:00 | Eric Rowland | Algebraic power series and their automatic complexity | |
| Tue | Jan 23 | 14:00 | Jakub Konieczny | Arithmetical subword complexity of automatic sequences | |
| Tue | Jan 09 | 14:00 | Clemens Müllner | Synchronizing automatic sequences along Piatetski-Shapiro sequences | |
| Tue | Dec 19 | 14:00 | Pierre Béaur | All I want for Christmas is an algorithm to detect a Sturmian word in an ω-regular language | |
| Tue | Dec 05 | 14:00 | Matthieu Rosenfeld | Word reconstruction using queries on subwords or factors | |
| Tue | Nov 21 | 14:00 | Seda Albayrak | Quantitative estimates for the size of an intersection of sparse automatic sets | |
| Tue | Nov 07 | 14:00 | Svetlana Puzynina | Well distributed occurrences property in infinite words | |
| Tue | Oct 24 | 13:00 | Herman Goulet-Ouellet | Density of rational languages under invariant measures | |
| Tue | Oct 10 | 13:00 | Ľubomíra Dvořáková | String attractors and pseudopalindromic closures | |
| Tue | Sep 26 | 13:00 | James Currie | The analogs of overlap-freeness for the period-doubling morphism and for the Fibonacci morphism | |
| Tue | Sep 12 | 13:00 | Bastián Espinoza | An S -adic characterization of linear-growth complexity subshifts | |
| Mon | May 22 | 13:00 | Matthieu Rosenfeld | TBA | |
| Mon | May 15 | 13:00 | Craig Kaplan | An aperiodic monotile | |
| Mon | May 08 | 13:00 | Mélodie Lapointe | Perfectly clustering words: Induction and morphisms | |
| Mon | Apr 03 | 13:00 | Jeffrey Shallit | New Results in Additive Number Theory via Combinatorics on Words | |
| Mon | Mar 27 | 13:00 | Štěpán Starosta | On a faithful representation of Sturmian morphisms | |
| Mon | Mar 06 | 14:00 | Léo Poirier and Wolfgang Steiner | Factor-balanced S -adic languages | |
| Mon | Feb 27 | 14:00 | Aline Parreau and Eric Duchêne | Taking and merging games as rewrite games | |
| Mon | Feb 06 | 14:00 | Matthew Konefal | Examining the Class of Formal Languages which are Expressible via Word Equations | |
| Mon | Jan 23 | 14:00 | Lubomíra Dvořáková | Essential difference between the repetitive thereshold and asymptotic repetitive threshold of balanced sequences | |
| Mon | Jan 09 | 14:00 | Pamela Fleischmann | $m$-Nearly $k$-Universal Words - Investigating Simon Congruence | |
| Mon | Dec 19 | 14:00 | Jason Bell | Noncommutative rational Pólya series | |
| Mon | Dec 05 | 14:00 | Josef Rukavicka | Palindromic factorization of rich words | |
| Mon | Nov 21 | 14:00 | Sebastián Barbieri | Indistinguishable asymptotic pairs | |
| Mon | Nov 07 | 14:00 | Daniel Krenn | $q$-Recursive Sequences and their Asymptotic Analysis | |
| Mon | Oct 24 | 13:00 | Natalie Behague | Synchronizing Times for $k$-sets in Automata | |
| Mon | Oct 17 | 13:00 | Giuseppe Romana | String Attractor: a Combinatorial object from Data Compression | |
| Mon | Oct 03 | 13:00 | Robbert Fokkink | A few words on games | |
| Mon | Sep 19 | 13:00 | Shuo Li | On the number of squares in a finite word | |
| Mon | Jul 11 | 13:00 | Zachary Chase | The separating words, $k$-deck, and trace reconstruction problems | |
| Mon | Jun 27 | 13:00 | Pierre Popoli | Maximum order complexity for some automatic and morphic sequences along polynomial values | |
| Mon | Jun 20 | 13:00 | Antoine Domenech | Avoiding doubled patterns | |
| Mon | Jun 13 | 13:00 | Kristina Ago and Bojan Bašić | Some recent results on two "palindromicity" measures | |
| Mon | May 30 | 13:00 | Pierre-Adrien Tahay | Column representation of words in cellular automata | |
| Mon | May 16 | 13:00 | Moussa Barro | Billard dans le cube | |
| Mon | Apr 25 | 13:00 | Christophe Reutenauer | Constructions and parametrization of conjugates of Christoffel words | |
| Mon | Apr 04 | 13:00 | Colin Defant | Anti-powers in Aperiodic Recurrent Words | |
| Mon | Mar 21 | 13:00 | Narad Rampersad | Applications of Walnut to problems of local periodicity | |
| Mon | Mar 07 | 14:00 | Jean-Paul Allouche | Thue and 7-3 | |
| Mon | Feb 21 | 14:00 | Etienne Moutot | Pattern complexity of 2D substitutive shifts | |
| Mon | Feb 07 | 14:00 | Michel Dekking | Combinatorics of Fibonacci and golden mean number representations | |
| Mon | Jan 24 | 14:00 | Markus Whiteland | On some decidable properties of discrete-time linear dynamical systems | |
| Mon | Jan 10 | 14:00 | Lubomíra Dvořáková | On minimal critical exponent of balanced sequences | |
| Mon | Dec 20 | 14:00 | Jakub Konieczny | Finitely-valued generalised polynomials | |
| Mon | Dec 06 | 14:00 | Gabriele Fici | Some Remarks on Automatic Sequences, Toeplitz words and Perfect Shuffling | |
| Mon | Nov 22 | 14:00 | Day of short talks | G. Kucherov, J. O. Shallit, J: Grytczuk, D. Gabric | |
| Mon | Nov 08 | 14:00 | Dan Rust | Random substitutions | |
| Mon | Oct 25 | 13:00 | Fabien Durand | Beyond substitutive sequences : Self-induced dynamical systems and sequences on compact alphabets | |
| Mon | Oct 11 | 13:00 | France Gheeraert | $S$-adic characterization of dendric languages: ternary case | |
| Mon | Sep 27 | 13:00 | Arseny Shur | Abelian repetition threshold revisited | |
| Mon | Jul 26 | 13:00 | Jason Bell | Lie complexity of words | |
| Mon | Jul 12 | 13:00 | Štěpán Holub | Using Isabelle/HOL in Combinatorics on Words research | |
| Mon | Jun 28 | 13:00 | Florin Manea | Efficiently testing Simon's congruence | |
| Mon | Jun 21 | 13:00 | Day of Short Talks | Jakub Byszewski, Jarosław Duda, Jarkko Peltomäki, Palak Pandoh, Clément Lagisquet, Bartłomiej Pawlik | |
| Mon | Jun 14 | 13:00 | Golnaz Badkobeh | Left Lyndon tree construction | |
| Mon | Jun 07 | 13:00 | Pascal Ochem | Avoiding large squares in trees and planar graphs | |
| Mon | May 31 | 13:00 | Etienne Moutot | Recent advances around Nivat's conjecture | |
| Mon | May 17 | 13:00 | Jeffrey Shallit | The Walnut Tutorial: Using A Tool for Doing Combinatorics on Words | |
| Mon | May 10 | 13:00 | Kevin Buzzard | Teaching computers to prove theorems | |
| Mon | May 03 | 13:00 | Gwenaël Richomme | On sets of indefinitely desubstitutable words | |
| Mon | Apr 26 | 13:00 | Luca Zamboni | Singular words | |
| Mon | Apr 12 | 13:00 | Valérie Goyheneche | Eigenvalues and constant arithmetical progressions for substitutive sequences | |
| Mon | Mar 29 | 13:00 | Jacques Sakarovitch | From Fibonacci to golden mean representations | |
| Mon | Mar 22 | 14:00 | Day of short talks | Day of short talks: I. Aedo, F. Dolce, A. Frid, J. Palacio, J. Shallit | |
| Mon | Mar 15 | 14:00 | Szymon Stankiewicz | Square-free reducts of words | |
| Mon | Mar 01 | 14:00 | Mickaël Postic | Open and closed complexity functions of infinite words | |
| Mon | Feb 22 | 14:00 | M. Andrieu, C. Cisterino, L. Dvořáková, Š. Holub, F. Manea, C. Reutenauer | Day of short talks | |
| Mon | Feb 15 | 14:00 | Petr Ambrož | Morphisms generating antipalindromic words | |
| Mon | Feb 08 | 14:00 | Robert Mercas | (Trying to do a) Counting of distinct repetitions in words | |
| Mon | Feb 01 | 14:00 | Jean-Paul Allouche | Hidden automatic sequences | |
| Mon | Jan 04 | 14:00 | Anna Frid | Is not prefix palindromic length of a k -automatic word k -regular? | |
| Mon | Dec 14 | 14:00 | Sébastien Labbé | A characterization of Sturmian sequences by indistinguishable asymptotic pairs | |
| Mon | Dec 07 | 14:00 | Marie Lejeune | Reconstructing words from right-bounded-block words | |
| Mon | Nov 23 | 14:00 | Émilie Charlier | Regular sequences in abstract numeration systems | |
| Mon | Nov 09 | 14:00 | Eric Rowland | Avoiding fractional powers on an infinite alphabet | |
| Mon | Oct 26 | 14:00 | Matthieu Rosenfeld | A simple proof technique to study avoidability of repetitions | |
| Mon | Oct 19 | 13:00 | Michel Dekking | The structure of Zeckendorf representations and base $\varphi$ expansions | |
| Mon | Oct 05 | 13:00 | Jarosław Grytczuk | Graph Coloring and Combinatorics on Words | |
| Mon | Sep 28 | 13:00 | Jarkko Peltomäki | Avoiding abelian powers cyclically | |
| Mon | Sep 14 | 13:00 | Reem Yassawi | The Ellis semigroup of bijective substitution shifts | |
| Mon | Jul 27 | 13:00 | James Currie | Remarks on Pansiot encodings | |
| Mon | Jul 20 | 13:00 | Laurent Vuillon | Combinatorics on words for Markoff numbers | |
| Mon | Jul 13 | 13:00 | Michel Rigo | Binomial^3 : coefficients, equivalence, complexity… | |
| Mon | Jun 29 | 13:00 | Lucas Mol | Extremal Square-Free Words and Variations | |
