Discussion
The pumping lemma for regular languages is used to prove that a language
Answer: D
Correct answer: is not regular by exhibiting a string that cannot be pumped
The lemma states a property that every regular language must have, so it is used contrapositively: choose a string in the language long enough that the lemma would apply, show that no way of pumping it stays inside the language, and conclude that the language is not regular. It can never be used to prove that a language is regular.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development