Problem 1. Use the pumping lemma for the regular language to prove that the following
languages are not regular. (1) A 1 = { 0 m 1 n 2 n m , n 0 } . (2) A 2 = { 0 n 1 n 2 n 0 } ..
Problem 1- Use the pumping lemma for the regular language to prove tha.pdf
1. Problem 1. Use the pumping lemma for the regular language to prove that the following
languages are not regular. (1) A 1 = { 0 m 1 n 2 n m , n 0 } . (2) A 2 = { 0 n 1 n 2 n 0 } .