BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:An asymptotic version of Cobham's theorem
DTSTART;VALUE=DATE-TIME:20221018T084500Z
DTEND;VALUE=DATE-TIME:20221018T094500Z
DTSTAMP;VALUE=DATE-TIME:20230206T163000Z
UID:indico-event-8637@indico.math.cnrs.fr
DESCRIPTION:Speakers: Jakub Konieczny\n\nCobham's theorem is one of the mo
st fundamental results in the theory of automatic sequences\, that is\, se
quences whose n-th term can be computed by a finite automaton which receiv
es as input the expansion of n in a given base k. The theorem asserts\, ro
ughly speaking\, that a sequence cannot be computed by finite automata in
two different bases\, except for the arguably trivial cases where the base
s are multiplicatively dependent (and hence lead to the same notion of aut
omaticity) or if the sequence is eventually periodic (and hence automatic
in each base). Over the years\, many extensions and analogues of this theo
rem have been established. During my talk\, I will introduce an asymptotic
analogue of the notion of an automatic sequence and show that such asympt
otically automatic sequences obey a variant of Cobham's theorem.\n\nhttps:
//indico.math.cnrs.fr/event/8637/
LOCATION:BĂ˘t. Braconnier\, salle Fokko du Cloux (ICJ\, UniversitĂ© Lyon 1
)
URL:https://indico.math.cnrs.fr/event/8637/
END:VEVENT
END:VCALENDAR