The following pages link to Marie Lejeune (Q2194757):
Displaying 9 items.
- The binomial equivalence classes of finite words (Q4970534) (← links)
- Reconstructing Words from Right-Bounded-Block Words (Q5041252) (← links)
- -adic characterization of minimal ternary dendric shifts (Q5053864) (← links)
- Computing the \(k\)-binomial complexity of the Thue-Morse word (Q5918904) (← links)
- Templates for the \(k\)-binomial complexity of the Tribonacci word (Q5919292) (← links)
- Computing the \(k\)-binomial complexity of the Thue-Morse word (Q5919664) (← links)
- Templates for the \(k\)-binomial complexity of the Tribonacci word (Q5919700) (← links)
- Reconstructing Words from Right-Bounded-Block Words (Q6169894) (← links)
- $\mathcal{S}$-adic characterization of minimal ternary dendric shifts (Q6361088) (← links)
