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}](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f3c6d087cb7_17666f3c6d025f8b.jpg)
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
Get step-by-step solutions from verified subject matter experts
