3 problems

Aperiodic-word complexity conjecture. For $n$ sufficiently large, the complexity of each individual aperiodic word is

Pentagon-language complexity conjecture. The normalized complexity has the limit

Asymmetric-period conjecture. Every even number other than $2$, $12$, $14$, and $18$ occurs as the period of an asymmetric periodic billiard trajectory on the pentagon.