Question
Which statement correctly describes pumping lemma for regular languages?
Select an option. Your answer will be checked instantly.
Correct Answer: B. a tool used to prove some languages are not regular
Explanation:
pumping lemma for regular languages is correctly described as a tool used to prove some languages are not regular.
Leave a Reply