Question: 2. Consider the language below: L = {(0k 1)n: k, n N}. For instance, we have 001001001 L (for k = 2 and n
2. Consider the language below: L = {(0k 1)n: k, n N}. For instance, we have 001001001 L (for k = 2 and n = 3), but 0010001 L. Prove that this language is not regular.
Step by Step Solution
3.54 Rating (154 Votes )
There are 3 Steps involved in it
To prove that the language L 01n k n N is not regular we can use the Pumping Lemma for regular langu... View full answer
Get step-by-step solutions from verified subject matter experts
