3 problems

Let $\mathfrak{L}'=\left\{w^{k}\:\ w\in\left(a\vert b\right)^{*},\ k>1\right\}$ be the language of nonprimitive words over the alphabet $\{a,b\}$. Nonprimitive-word ambiguity conje…

Let $\mathfrak{L}_{comp}=\left\{0^{c}\:\ c\ \mathrm{is\ composite}\right\}$ be the unary language of composite numbers. Composite-number ambiguity conjecture. The language…

Let $\mathfrak{L}_{Crestin}=\left\{vw\:\ v,w\in\left(a\vert b\right)^{*},\ v=v^{R},\ w=w^{R}\right\}$ be the language of concatenated palindrome pairs over the alphabet $\{a,b\}$.…