a. Let B = {1 k y| y {0, 1} * and y contains at least

Question:

a. Let B = {1ky| y ∈ {0, 1}* and y contains at least k 1s, for k ≥ 1}.

Show that B is a regular language.

b. Let C = {1ky| y ∈ {0, 1}* and y contains at most k 1s, for k ≥ 1}.

Show that C isn’t a regular language.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: