Question: Show that the language L = { a n b k c n : n 0 , k n } is not regular. 3 .

Show that the language
L={anbkcn:n0,kn}
is not regular.
3. Show that the language
L={anbkcndk:n0,k>n}
is not regular.
4. Show that the language
L={w:na(w)=nb(w)}
is not regular. Is L* regular?
5. Prove that the following languages are not regular:
(a)L={anblak:kn+l}.
(b)L={anblak:kn+l}.
(c)L={anblak:n=l or {:lk}.
(d)L={anbl:nl}.
(e)L={w:na(w)nb(w)}.
(f)L={ww:win{a,b}*}.
(g)L={wRwwwR:win{a,b}*}.
6. Determine whether or not the following languages on ={a} are regular:
(a)L={an:n2 is a prime number
 Show that the language L={anbkcn:n0,kn} is not regular. 3. Show that

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!