Add to ORKGIn 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)
La complexité en nombre d'états (state complexity) d'un langage régulier est le nombre d'états de so...
peer reviewedWe study the structure of automata accepting the greedy representations of N in a wide...
AbstractWe show that the proportion of the Morse sequence which can be tiled by one word is exactly ...
In this talk, I present the constructive proof of the theorem which states that the state complexity...
In this talk, we present our results about the state complexity of the multiples of the Thue-Morse s...
In this talk, we present our results about the state complexity of the multiples of the Thue-Morse s...
peer reviewedThe Thue-Morse set T is the set of those non-negative integers whose binary expansions ...
Two infinite words that are connected with some significant univoque numbers are studied. It is show...
peer reviewedUnder some mild assumptions, we study the state complexity of the trim minimal automato...
This dissertation thesis is made up of three distinct parts, connected especially by complexity noti...
summary:We prove that the generalized Thue-Morse word $\mathbf{t}_{b,m}$ defined for $b \ge 2$ and $...
AbstractWe solve the following problem proposed by Straubing. Given a two-letter alphabet A, what is...
In this talk, we first present an introduction to combinatorics on words and to automata and formal ...
AbstractThe paper determines the number of states in two-way deterministic finite automata (2DFA) ov...
AbstractLet the (subword) complexity of a sequence u=(un)n=0∞ over a finite set Σ be the function m↦...
La complexité en nombre d'états (state complexity) d'un langage régulier est le nombre d'états de so...
peer reviewedWe study the structure of automata accepting the greedy representations of N in a wide...
AbstractWe show that the proportion of the Morse sequence which can be tiled by one word is exactly ...
In this talk, I present the constructive proof of the theorem which states that the state complexity...
In this talk, we present our results about the state complexity of the multiples of the Thue-Morse s...
In this talk, we present our results about the state complexity of the multiples of the Thue-Morse s...
peer reviewedThe Thue-Morse set T is the set of those non-negative integers whose binary expansions ...
Two infinite words that are connected with some significant univoque numbers are studied. It is show...
peer reviewedUnder some mild assumptions, we study the state complexity of the trim minimal automato...
This dissertation thesis is made up of three distinct parts, connected especially by complexity noti...
summary:We prove that the generalized Thue-Morse word $\mathbf{t}_{b,m}$ defined for $b \ge 2$ and $...
AbstractWe solve the following problem proposed by Straubing. Given a two-letter alphabet A, what is...
In this talk, we first present an introduction to combinatorics on words and to automata and formal ...
AbstractThe paper determines the number of states in two-way deterministic finite automata (2DFA) ov...
AbstractLet the (subword) complexity of a sequence u=(un)n=0∞ over a finite set Σ be the function m↦...
La complexité en nombre d'états (state complexity) d'un langage régulier est le nombre d'états de so...
peer reviewedWe study the structure of automata accepting the greedy representations of N in a wide...
AbstractWe show that the proportion of the Morse sequence which can be tiled by one word is exactly ...