## Exercise ‹18›:

Regular description for $\{ \mathtt{intercal}(w_1,w_2) \mid w_1,w_2\in\{0,1\}^*\;\wedge\;|w_1|=|w_2|\;\wedge\;\mathtt{value}_2(w_1)>\mathtt{value}_2(w_2) \}$,
where $\mathtt{intercal}(a_1w_1,\ldots,a_nw_n)=a_1\ldots a_n\mathtt{intercal}(w_1,\ldots,w_n)$ and $\mathtt{intercal}(\lambda,\ldots,\lambda)=\lambda$
Give a regular description for the set of words obtained by intercaling two words $w_1,w_2$ over $\{0,1\}$ with the same length and such that the natural value obtained by interpreting $w_1$ as a binary number, that is $\mathtt{value}_2(w_1)$, is bigger than $\mathtt{value}_2(w_2)$.

Intercaling $n$ words $w_1,\ldots,w_n$ over $\{0,1\}$ and with the same length gives as result a word whose sequence of symbols is: the first symbol of $w_1$, the first symbol of $w_2$, …, the first symbol of $w_n$, the second symbol of $w_1$, the second symbol of $w_2$, …, the second symbol of $w_n$, the third symbol of $w_1$, and so on.
Authors: Guillem Godoy / Documentation:
 main { // Write here your regular description... } To be able to submit you need to either log in, register, or become a guest.