Question
In an automata or formal-language problem, which option best represents 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:
In this course context, pumping lemma for regular languages means a tool used to prove some languages are not regular.
Leave a Reply