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 }

Aisha has finished working on a word processing document that contains 15 pages. she has added some special elements in the first three pages, page 9 and 10, and page 15 from the document. she wants to print only these pages to see how they look. which option is the correct way to represent (in the print dialog box) the pages that aisha wants to print

Asecurity policy is a a. set of guidlines b. set of transmission protocols c. written document d. set of rules based on standards and guidelines

Where are american poets found in the dewey decimal system