Question

Prove that the following languages are not regular. You may use the pumping lemma and the closure of the class of regular languages under union, intersection, and compliment.

a){010 m,n>0}

b){0^{m}1^{n}| m \neq n}

c) {w| w \epsilon \left \{0 \right, 1\}* is not a palindrome}

*d)\{wtw| w,t \epsilon \left \{ 0 \right 1\}+ \right\}}

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Solution:

a)

(0^n 1^n 0^n}
Since, Regular languages are dosed under union, intersection and complement. L U 0^n1^m0^n = {0^n1^m0^n, m,n >= 0 } is irregular
b. 10m 1 m n) Since Regular languages are closed under union, intersection and complement. . L . 0rn In = {Om 1n m = n} is i

I hope this helps if you find any problem. Please comment below. Don't forget to give a thumbs up if you liked it. :)

Add a comment
Know the answer?
Add Answer to:
Prove that the following languages are not regular. You may use the pumping lemma and the...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT