Thue-Morse set; Automaton; State complexity; Formal language; Multiplication by a constant; Translation
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
Publication date :
02 September 2019
Event name :
The Tenth International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2019)
