One World Combinatorics on Words Seminar

External homepage

formal languages and automata theory combinatorics dynamical systems

Audience: Researchers in the topic
Seminar series time: Tuesday 14:00-15:00 in your time zone, UTC
Organizers: Anna Frid*, Narad Rampersad, Jeffrey Shallit*, Manon Stipulanti
*contact for this listing

Please write to Anna Frid to receive the Zoom password and further announcements.

Upcoming talks
Past talks
Your timeSpeakerTitle
TueMar 0514:00Finn LidbetterTBA
TueMar 1914:00Cor KraaikampTBA
TueApr 0213:00John CampbellOn the evaluation of infinite products involving automatic sequences
TueApr 1613:00Radoslaw PiórkowskiTBA
TueApr 3013:00Michael BaakeTBA
TueMay 1413:00Josef RukavickaTBA
Embed this schedule
Your timeSpeakerTitle
TueFeb 2014:00Christopher CabezasLarge normalizer of odometers and higher-dimensional automatic sequences
TueFeb 0614:00Eric RowlandAlgebraic power series and their automatic complexity
TueJan 2314:00Jakub KoniecznyArithmetical subword complexity of automatic sequences
TueJan 0914:00Clemens MüllnerSynchronizing automatic sequences along Piatetski-Shapiro sequences
TueDec 1914:00Pierre BéaurAll I want for Christmas is an algorithm to detect a Sturmian word in an ω-regular language
TueDec 0514:00Matthieu RosenfeldWord reconstruction using queries on subwords or factors
TueNov 2114:00Seda AlbayrakQuantitative estimates for the size of an intersection of sparse automatic sets
TueNov 0714:00Svetlana PuzyninaWell distributed occurrences property in infinite words
TueOct 2413:00Herman Goulet-OuelletDensity of rational languages under invariant measures
TueOct 1013:00Ľubomíra DvořákováString attractors and pseudopalindromic closures
TueSep 2613:00James CurrieThe analogs of overlap-freeness for the period-doubling morphism and for the Fibonacci morphism
TueSep 1213:00Bastián EspinozaAn S -adic characterization of linear-growth complexity subshifts
MonMay 2213:00Matthieu RosenfeldTBA
MonMay 1513:00Craig KaplanAn aperiodic monotile
MonMay 0813:00Mélodie LapointePerfectly clustering words: Induction and morphisms
MonApr 0313:00Jeffrey ShallitNew Results in Additive Number Theory via Combinatorics on Words
MonMar 2713:00Štěpán StarostaOn a faithful representation of Sturmian morphisms
MonMar 0614:00Léo Poirier and Wolfgang SteinerFactor-balanced S -adic languages
MonFeb 2714:00Aline Parreau and Eric DuchêneTaking and merging games as rewrite games
MonFeb 0614:00Matthew KonefalExamining the Class of Formal Languages which are Expressible via Word Equations
MonJan 2314:00Lubomíra DvořákováEssential difference between the repetitive thereshold and asymptotic repetitive threshold of balanced sequences
MonJan 0914:00Pamela Fleischmann$m$-Nearly $k$-Universal Words - Investigating Simon Congruence
MonDec 1914:00Jason BellNoncommutative rational Pólya series
MonDec 0514:00Josef RukavickaPalindromic factorization of rich words
MonNov 2114:00Sebastián BarbieriIndistinguishable asymptotic pairs
MonNov 0714:00Daniel Krenn$q$-Recursive Sequences and their Asymptotic Analysis
MonOct 2413:00Natalie BehagueSynchronizing Times for $k$-sets in Automata
MonOct 1713:00Giuseppe RomanaString Attractor: a Combinatorial object from Data Compression
MonOct 0313:00Robbert FokkinkA few words on games
MonSep 1913:00Shuo LiOn the number of squares in a finite word
MonJul 1113:00Zachary ChaseThe separating words, $k$-deck, and trace reconstruction problems
MonJun 2713:00Pierre PopoliMaximum order complexity for some automatic and morphic sequences along polynomial values
MonJun 2013:00Antoine DomenechAvoiding doubled patterns
MonJun 1313:00Kristina Ago and Bojan BašićSome recent results on two "palindromicity" measures
MonMay 3013:00Pierre-Adrien TahayColumn representation of words in cellular automata
MonMay 1613:00Moussa BarroBillard dans le cube
MonApr 2513:00Christophe ReutenauerConstructions and parametrization of conjugates of Christoffel words
MonApr 0413:00Colin DefantAnti-powers in Aperiodic Recurrent Words
MonMar 2113:00Narad RampersadApplications of Walnut to problems of local periodicity
MonMar 0714:00Jean-Paul AlloucheThue and 7-3
MonFeb 2114:00Etienne MoutotPattern complexity of 2D substitutive shifts
MonFeb 0714:00Michel DekkingCombinatorics of Fibonacci and golden mean number representations
MonJan 2414:00Markus WhitelandOn some decidable properties of discrete-time linear dynamical systems
MonJan 1014:00Lubomíra DvořákováOn minimal critical exponent of balanced sequences
MonDec 2014:00Jakub KoniecznyFinitely-valued generalised polynomials
MonDec 0614:00Gabriele FiciSome Remarks on Automatic Sequences, Toeplitz words and Perfect Shuffling
MonNov 2214:00Day of short talksG. Kucherov, J. O. Shallit, J: Grytczuk, D. Gabric
MonNov 0814:00Dan RustRandom substitutions
MonOct 2513:00Fabien DurandBeyond substitutive sequences : Self-induced dynamical systems and sequences on compact alphabets
MonOct 1113:00France Gheeraert$S$-adic characterization of dendric languages: ternary case
MonSep 2713:00Arseny ShurAbelian repetition threshold revisited
MonJul 2613:00Jason BellLie complexity of words
MonJul 1213:00Štěpán HolubUsing Isabelle/HOL in Combinatorics on Words research
MonJun 2813:00Florin ManeaEfficiently testing Simon's congruence
MonJun 2113:00Day of Short TalksJakub Byszewski, Jarosław Duda, Jarkko Peltomäki, Palak Pandoh, Clément Lagisquet, Bartłomiej Pawlik
MonJun 1413:00Golnaz BadkobehLeft Lyndon tree construction
MonJun 0713:00Pascal OchemAvoiding large squares in trees and planar graphs
MonMay 3113:00Etienne MoutotRecent advances around Nivat's conjecture
MonMay 1713:00Jeffrey ShallitThe Walnut Tutorial: Using A Tool for Doing Combinatorics on Words
MonMay 1013:00Kevin BuzzardTeaching computers to prove theorems
MonMay 0313:00Gwenaël RichommeOn sets of indefinitely desubstitutable words
MonApr 2613:00Luca ZamboniSingular words
MonApr 1213:00Valérie GoyhenecheEigenvalues and constant arithmetical progressions for substitutive sequences
MonMar 2913:00Jacques SakarovitchFrom Fibonacci to golden mean representations
MonMar 2214:00Day of short talksDay of short talks: I. Aedo, F. Dolce, A. Frid, J. Palacio, J. Shallit
MonMar 1514:00Szymon StankiewiczSquare-free reducts of words
MonMar 0114:00Mickaël PosticOpen and closed complexity functions of infinite words
MonFeb 2214:00M. Andrieu, C. Cisterino, L. Dvořáková, Š. Holub, F. Manea, C. ReutenauerDay of short talks
MonFeb 1514:00Petr AmbrožMorphisms generating antipalindromic words
MonFeb 0814:00Robert Mercas(Trying to do a) Counting of distinct repetitions in words
MonFeb 0114:00Jean-Paul AlloucheHidden automatic sequences
MonJan 0414:00Anna FridIs not prefix palindromic length of a k -automatic word k -regular?
MonDec 1414:00Sébastien LabbéA characterization of Sturmian sequences by indistinguishable asymptotic pairs
MonDec 0714:00Marie LejeuneReconstructing words from right-bounded-block words
MonNov 2314:00Émilie CharlierRegular sequences in abstract numeration systems
MonNov 0914:00Eric RowlandAvoiding fractional powers on an infinite alphabet
MonOct 2614:00Matthieu RosenfeldA simple proof technique to study avoidability of repetitions
MonOct 1913:00Michel DekkingThe structure of Zeckendorf representations and base $\varphi$ expansions
MonOct 0513:00Jarosław GrytczukGraph Coloring and Combinatorics on Words
MonSep 2813:00Jarkko PeltomäkiAvoiding abelian powers cyclically
MonSep 1413:00Reem YassawiThe Ellis semigroup of bijective substitution shifts
MonJul 2713:00James CurrieRemarks on Pansiot encodings
MonJul 2013:00Laurent VuillonCombinatorics on words for Markoff numbers
MonJul 1313:00Michel RigoBinomial^3 : coefficients, equivalence, complexity…
MonJun 2913:00Lucas MolExtremal Square-Free Words and Variations
Embed this schedule
Export series to