Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Theory of Computation Regular Languages and Finite Automata Regular Languages
Pumping lemma for regular sets is used to
1
Prove that certain sets are regular
2
Prove that certain sets are not regular
3
Generate context free language
4
Generate context sensitive language
5
Question Not Attempted