Computer Sciences > Gate 2020 > Regular Language
Consider the following languages.
L1 = { wxyx ∣ w,x,y ∈ (0+1)+ }
L2 = { xy ∣ x,y ∈ (a+b)*, ∣x∣=∣y∣, x≠y }
Which one of the following is TRUE ?L2 = { xy ∣ x,y ∈ (a+b)*, ∣x∣=∣y∣, x≠y }
Correct : a
Similar Questions
Consider the following statements
I. If L1∪L2 is regular, then both L1 and L2 must be regular.
II. The class of regular languages is closed under infinite uni...
Consider the following statements
I. If L1∪L2 is regular, then both L1 and L2 must be regular.
II. The class of regular languages is closed under infinite uni...
Consider the following statements
I. If L1∪L2 is regular, then both L1 and L2 must be regular.
II. The class of regular languages is closed under infinite uni...
Total Unique Visitors
Loading......