Introduction to the Theory of Computation

Problem 3: Regular vs Nonregular (20 points) Prove the followings: (a.) Let B= {1k y e {0,1}* and y contains at least k ls, for k >1}. Show that B is a regular language. (b.) Let C = {1kyly E {0,1}* and y contains at most k ls, for k > 1}. Show that C is not a regular language