Automatic multiplicative sequences

Abstract: Automatic sequences - that is, sequences computable by finite automata - give rise to one of the most basic models of computation. As such, for any class of sequences it is natural to ask which sequences in it are automatic. In particular, the question of classifying automatic multiplicative sequences has attracted considerable attention in recent years. In the completely multiplicative case, such classification was obtained independently by S. Li and O. Klurman and P. Kurlberg. The main topic of my talk will be the resolution of the general case, obtained in a recent preprint with M. Lemańczyk and C. Müllner.

dynamical systems

Audience: researchers in the topic

Dynamical systems seminar at the Jagiellonian University