Question: 4) Explain why the pumping lemma won't work on the following languages (i.e., show where it fails - it's already obvious they're regular because the
4) Explain why the pumping lemma won't work on the following languages (i.e., show where it fails - it's already obvious they're regular because the first 2 are finite and the last 2 are regular expressions): i) The empty set ii) {00,11} iii) (00+11)* iv) 01*01*
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
