BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:5988@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20220711T150000
DTEND;TZID=Europe/Paris:20220711T160000
DTSTAMP:20241120T200712Z
URL:https://www.i2m.univ-amu.fr/evenements/the-separating-words-k-deck-and
 -trace-reconstruction-problems/
SUMMARY:Zachary Chase (University of Oxford): The separating words\, k-deck
 \, and trace reconstruction problems
DESCRIPTION:Zachary Chase: What is the smallest size of a DFA that can sepa
 rate two given strings of length n? Can two distinct strings of length n h
 ave the same multiset of subsequences of length n1/3? How many random subs
 equences of length n/2 of an unknown string x of length n do you need to d
 etermine x with high probability? We discuss these three problems\, each h
 aving an exponential gap between the best known upper and lower bounds\, a
 nd touch upon how they might be more related than one might expect.\nVideo
  and slides here : https://www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words
 -seminar/\n\n&nbsp\;\n\n\n\nThe address of the Zoom meeting is https://zoo
 m.us/j/92245493528 . The password is distributed in announcements. If you 
 want to receive them\, or receive them and want to unsubscribe\, please wr
 ite to Anna Frid.
CATEGORIES:Combinatorics on Words Seminar,Virtual event
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20220327T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR