Computer Sciences > GATE 2021 SET-1 > Formal Languages and Automata Theory
Consider the following statements.
S1: For every infinite regular language L, there exists a subset L′ of L such that L′ is infinite and context-free.
S2: For every context-free language L, there exists a subset L′ of L such that L′ is infinite and regular.
Which one of the following options is correct?
S1: For every infinite regular language L, there exists a subset L′ of L such that L′ is infinite and context-free.
S2: For every context-free language L, there exists a subset L′ of L such that L′ is infinite and regular.
Which one of the following options 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.