2 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 $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.…