Computer Sciences > GATE 2014 SET-2 > Regular Languages
Let L1 = {w ∈ {0, 1}∗ | w has at least as many occurrences of (110)'s as (011)'s}. Let L2 = {w ∈ {0, 1}∗ | w has at least as many occurrences of (000)'s as (111)'s}. Which one of the following is TRUE?
Correct : a
Similar Questions
Let L1, L2 be two regular languages and L3 a language which is not regular. Which of the following statements is/are always TRUE?
Which of the following languages is/are regular? L1 = {wxwR | w, x ∈ {a, b}* and |w|, |x| > 0}, wR is the reverse of string w. L2 = {anbm | m ≠ n and...
Consider the following two languages over the alphabet {a, b}:L1={αβα|α∈{a,b}+ AND β∈{a,b}+}L2={αβα|&alph...
Total Unique Visitors
Loading......