Regular language – Theory Of Computing
|Question 1 UGC NET June-2020 |
|A – L1 and L2 only|
|B – L1 and L3 only|
|C – L1 only|
|D – L2 only|
|E – None of the above|
|Question 2 UGC NET June-2020 |
Let L1 and L2 be languages over Σ =(a,b) represented by the regular expressions (a* + b)* and (a+b)* respectively.
Which of the following is true with respect to the two languages?
|A – L1 ⊂ L2|
|B – L2 ⊂ L1|
|C – L1 = L2|
|D – L1 ∩ L2 = ɸ|