a. Let B = {1ky
Chapter , Problem 1.49(choose chapter or problem)
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 isnt a regular language.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer