research
∙
01/04/2023
Reconstructing words using queries on subwords or factors
We study word reconstruction problems. Improving a previous result by P....
share
research
∙
01/19/2022
It is undecidable whether the growth rate of a given bilinear system is 1
We show that there exists no algorithm that decides for any bilinear sys...
research
∙
07/29/2021
Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters
We consider two games between two players Ann and Ben who build a word t...
research
∙
04/20/2021
Avoiding squares over words with lists of size three amongst four symbols
In 2007, Grytczuk conjecture that for any sequence (ℓ_i)_i≥1 of alphabet...
research
∙
08/12/2020
Lower-bounds on the growth of power-free languages over large alphabets
We study the growth rate of some power-free languages. For any integer k...
research
∙
06/16/2020
Another approach to non-repetitive colorings of graphs of bounded degree
We propose a new proof technique that aims to be applied to the same pro...
research
∙
04/14/2020
The growth rate over trees of any family of set defined by a monadic second order formula is semi-computable
Monadic second order logic can be used to express many classical notions...
research
∙
01/31/2020
On the binomial equivalence classes of finite words
Two finite words u and v are k-binomially equivalent if, for each word x...
research
∙
03/11/2019
How far away must forced letters be so that squares are still avoidable?
We describe a new non-constructive technique to show that squares are av...
research
∙
08/27/2018