1 problem

Let $q$ be the alphabet size, let $n$ be the length, and let $m$ be the number of component sequences. Write $E_n^{(m)}$ for the expected linear complexity of an $m$-multisequence…