Hello,
I’ve encountered with a difficult question i don’t know how to solve. the question is about proving that a language is regular based on two language over the same $\Sigma$.
the questions goes as following:
$L_1$ and $L_2$ are regular languages over the same $\Sigma$, $(i=1,2,3,..,n)\sigma_i \in \Sigma$ $(n \geq 0)$, exists $(i = 1,2,3,…, n)\mu_1,\xi_1 \in Sigma$ for which $L^\wedge = \{\sigma_1\sigma_2...\sigma_n | \mu_1\mu_2...\mu_n \in L_2$ AND $\sigma_1\mu_1\xi_1...\sigma_n\mu_n\xi_n \in L_1$.
additional info: $\epsilon \in L^\wedge \iff \epsilon \in L_1 \land \epsilon \in L_2$ (epsilon needs to be in both to be in $L^\wedge$).
how can this thing be proven using closure properties or a multipication automaton?
i know it’s complicated and would appreciate help with it.
thank you very much your much appreciated help!
