Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

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
image text in transcribed

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

More Books

Students also viewed these Databases questions