mathmari
Gold Member
MHB
- 4,984
- 7
Hey! 
How can we show that the class of regular languages is closed under the following operation??
Let $L_1$ and $L_2$ be laguages over $\Sigma=\{0, 1\}$.
The operation is: $$\{x \in L_1 | \text{ for some } y \in L_2, \text{ strings } x \text{ and } y \text{ contains equal numbers of } 1s \}$$
(Wondering)
Is the only way to show this to create a NFA of the new language?? (Wondering)

How can we show that the class of regular languages is closed under the following operation??
Let $L_1$ and $L_2$ be laguages over $\Sigma=\{0, 1\}$.
The operation is: $$\{x \in L_1 | \text{ for some } y \in L_2, \text{ strings } x \text{ and } y \text{ contains equal numbers of } 1s \}$$
(Wondering)
Is the only way to show this to create a NFA of the new language?? (Wondering)