Thue-Morse set; Automaton; Formal language; State complexity; Multiplication by a constant
Abstract :
[en] In this talk, we present our results about the state complexity of the multiples of the Thue-Morse set written in base 2^p. We give our main result and explain the ideas of the proof, which is constructive.
Disciplines :
Mathematics
Author, co-author :
Massuir, Adeline ; 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
