# Theory Of Computation Test – Question 1

Let $L_1$ and $L_2$ be two Regular languages. Now consider the following language $L$.

$L&space;=&space;\left&space;\{&space;w\,\,\,\,|&space;\,\,\,w&space;\in&space;L_1&space;\,\,&space;and&space;\,\,&space;w^R&space;\in&space;L_2&space;\right&space;\}$

Where $w^R$ is Reverse of String $w$

Which of the following is True regarding language $L$?

1.

2.

3.

4.