Abstract: In 1969 Alan Cobham proved that if a finite state automaton recognizes a set in base a, then it does not recognize it in b (unless the set is trivial, or unless base a and b are equivalent). In his 1974 textbook on automata, Eilenberg asked for a "more reasonable" proof of Cobham's theorem. In this talk I will discuss a recent new proof by Thijmen Krebs of this theorem, and how this work relates to results in Diophantine approximation and in dynamics.
https://univienna.zoom.us/j/7309112392?pwd=Z0ZydTB0ZEk4bFVBNzNDaDR5UHEwQT09
Meeting ID: 730 911 2392 Passcode: dimensions