Use the pumping lemma to show that the following languages are not regular.

a a. a1={0^n 1^n 2^n | n≥0}
b. a2 = {www | w ∈ {a, b}∗}

a c. a3 ={a^2^n | n≥0} (here, a^2^n means a string of 2^n a’s.)

a ={a3n |n > 0 }

This chapter lists many ways in which becoming computer literate is beneficial. think about what your life will be like once you’re started in your career. what areas of computing will be most important for you to understand? how would an understanding of computer hardware and software you in working from home, working with groups in other countries and contributing your talents.