Question: Let B = { 1 ky | y in { 0 , 1 } and y contains at most k 1 s , for k
Let B ky y in and y contains at most k s for k Show that it is not a regular language
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
