5 problems

Let $T(\mathcal{LIN})$ and $U(\mathcal{I})$ denote the transduced linear and uniform indexed classes of binary relations. Linear-indexed incomparability conjecture. … The claim con…

Let $T(\mathcal{CF})$ and $U(\mathcal{ET}0\mathcal{L})$ denote the transduced context-free and uniform ET0L classes of binary relations. Incomparability conjecture. … The supplied…

Let $X$ be an alphabet, and let $U(\mathcal{I})$ and $T(\mathcal{I})$ denote the corresponding uniform and transduced classes of binary relations generated from indexed languages.…

Sorting-language hierarchy conjecture. For sufficiently large $n$,

Let $p:\mathbb{N}\rightarrow\mathbb{N}$ be a polynomial function. The relation associated with $p$ is denoted by $\rho_p$. Polynomial ET0L conjecture. … The claim extends the exhib…