Question: 3. Two similar but different languages [Problem 1.49]. (a) Let B={1kww{0,1} and w contains at least k s, for k1}. Show that B is a

 3. Two similar but different languages [Problem 1.49]. (a) Let B={1kww{0,1}

3. Two similar but different languages [Problem 1.49]. (a) Let B={1kww{0,1} and w contains at least k s, for k1}. Show that B is a regular language. Hint: Try out some strings to see what does and doesn't belong to B, in order to find another simpler way of thinking about B. (b) Let C={1kww{0,1} and w contains at most k 1s, for k1}. Prove that C is not a regular language

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!