Question

5. Prove that the following languages are not regular: (a) L = {abak-k < n+1). (b) L-(angla: kメn + 1). (c) L = {anglak : n
(d) L = {anb : n2 1} L = {w : na (w)关nb (w)). (f) L = {ww : w E {a, b)). (g) L = {wwww : w E {a,b}*}
0 0
Add a comment Improve this question Transcribed image text
Answer #1

skp Assume thot language L as vula tep2 considvr a sting Atving gensTaled uage 1 Case 11).. Iy/>ο a) o Cee(11) ,.. I abal sNovo pit into aparb 2. .3 2チ 1 20 介vue vue Caue (tto にab cb) aaaa 2 ab al 41. Caxe (11) t is notygula as ygula StepAsume thaTvue . case 3 fail 1t is not regular Step Assume hot uage L as veguula に2. n:3 Nouo Aput into s park 2.SUe Νοω cheeK 3 Cases. Case i) aaaaa aaaaa bibb >O 5 41 yue rue aaaoa (bb) bb Case uii) fail 3t in not regula la r. do nent

Add a comment
Know the answer?
Add Answer to:
5. Prove that the following languages are not regular: (a) L = {a"bak-k < n+1). (b)...
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