Combinatorics on Words Seminar

Évènements à venir / Upcoming talks

2023-10-10 Ľubomíra DvořákováString attractors and pseudopalindromic closures
2023-10-24 Herman Goulet-OuelletTitle to be announced - Herman Goulet-Ouellet
2023-11-07 Svetlana PuzyninaTitle to be announced - Svetlana Puzynina
2023-11-21 Seda AlbayrakQuantitative estimates for the size of an intersection of sparse automatic sets


Nature Séminaire virtuel international / International Virtual Seminar
Responsables Anna E. Frid, Aix-Marseille Université,
Narad Rampersad, University of Winnipeg,
Jeffrey O. Shallit, University of Waterloo,
Manon Stipulanti, Université de Liège.
Fréquence Bimensuel (depuis le 29/06/2020)
Jour-Horaire Lundi, 15h-16h (heure de Paris)

If you are interested in giving a talk, you are welcome to contact Narad Rampersad and Manon Stipulanti.

The address of the Zoom meeting is . The password is distributed in announcements. If you want to receive them, or receive them and want to unsubscribe, please write to Anna Frid.

All recorded talks are also available here.

Évènements passés / Past talks (Only from 2022)

2023-09-26James CurrieThe analogs of overlap-freeness for the period-doubling morphism and for the Fibonacci morphism
2023-09-12Bastián EspinozaAn S-adic characterization of linear-growth complexity subshifts
2023-05-22Matthieu RosenfeldTitle to be announced - Matthieu Rosenfeld
2023-05-15Craig KaplanAn aperiodic monotile
2023-05-08Mélodie LapointePerfectly clustering words: Induction and morphisms
2023-04-17Bastián EspinozaAn S-adic characterization of linear-growth complexity subshifts (POSTPONED)
2023-04-03Jeffrey O. ShallitNew results in additive number theory via combinatorics on words
2023-03-27Štěpán StarostaOn a faithful representation of Sturmian morphisms
2023-03-06Léo Poirier, Wolfgang SteinerFactor-balanced S-adic languages
2023-02-27Aline Parreau, Eric DuchêneTaking and merging games as rewrite games
2023-02-06Matthew KonefalExamining the class of formal languages which are expressible via word equations
2023-01-23Lubomíra DvořákováEssential difference between the repetitive thereshold and asymptotic repetitive threshold of balanced sequences
2023-01-09Pamela Fleischmannm-Nearly k-Universal Words - Investigating Simon Congruence
2022-12-19Jason BellNoncommutative rational Pólya series
2022-12-05Josef RukavickaPalindromic factorization of rich words
2022-11-21Sebastián BarbieriIndistinguishable asymptotic pairs
2022-11-07Daniel Krennq-recursive sequences and their asymptotic analysis
2022-10-24Natalie BehagueSynchronizing times for k-sets in automata
2022-10-17Giuseppe RomanaString attractor: a combinatorial object from data compression
2022-10-03Robbert FokkinkA few words on games
2022-09-19Shuo LiOn the number of squares in a finite word
2022-07-11Zachary ChaseThe separating words, k-deck, and trace reconstruction problems
2022-06-27Pierre PopoliMaximum order complexity for some automatic and morphic sequences along polynomial values


Archives 2022
Archives 2021
Archives 2020


Retour en haut 

Secured By miniOrange