engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Context Free Languages and Pushdown Automata Context Free Languages
Which of the following languages accept pumping lemma?
1
Regular Languages
2
Context Free Languages
3
Recursive Languages
4
Recursively Enumerable Languages