engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Theory of Computation Regular Languages and Finite Automata
The “Pumping lemma for regular languages” when applied to a given language L can be used for which of the following purposes?
1
To prove that L is not regular.
2
To prove that L is regular.
3
To construct a regular expression for L.
4
All of these.