Question
What is meant by pumping lemma for regular languages in Theory of Automata and Formal Languages?
Correct Answer: C
a tool used to prove some languages are not regular
The correct answer is a tool used to prove some languages are not regular.
The correct answer is a tool used to prove some languages are not regular.
Leave a Reply