Computer Sciences > GATE 2025 SET-1 > Regular Languages
Consider the following two languages over the alphabet {a, b}:
L1={αβα|α∈{a,b}+ AND β∈{a,b}+}
L2={αβα|α∈{a}+ AND β∈{a,b}+}
Which ONE of the following statements is CORRECT?
L1={αβα|α∈{a,b}+ AND β∈{a,b}+}
L2={αβα|α∈{a}+ AND β∈{a,b}+}
Which ONE of the following statements is CORRECT?
Explanation
Correct : c
Similar Questions
What is the worst-case time complexity of insertion in an AVL tree?
Which operations on a binary search tree have O(h) complexity?
Compare search complexities of sorted array vs balanced BST.