Automatic sequences - that is, sequences computable by finite automata,provide a basic model for computation. The main objective of the present talk is to show how a blend of ideas from number theory, combinatorics and ergodic theory can be used to characterize automatic sets with some
multiplicative properties.
Zoom Online Meeting ID: 919 6497 4060
For password see the email or contact Peter Moree (moree@mpim...).
Links:
[1] http://www.mpim-bonn.mpg.de/taxonomy/term/39
[2] http://www.mpim-bonn.mpg.de/node/246