Question: Show that the languages are not regular. (c) L=(an:n 2, is a prime number) (d) L = {an : n is not a prime number)
(c) L=(an:n 2, is a prime number) (d) L = {an : n is not a prime number) (e) L = {an : n = 2k for some k 20}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
