Automata; Thue-Morse; Recognizability; Integer Base
Abstract :
[en] In this talk, I present the main results about the state complexity of the multiples of the Thue-Morse set wrtiten in base 2^p. More precisely, I explain the constructive proof and the different automata built in order to obtain the main theorem.
This a work in collaboration with Émilie Charlier and Adeline Massuir (University of Liège, Belgium).
Disciplines :
Mathematics
Author, co-author :
Cisternino, Célia ; Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Language :
English
Title :
State complexity of the multiples of the Thue-Morse set
Alternative titles :
[fr] Complexité en états des multiples de l'ensemble de Thue-Morse
