Theory of computation

CSCI 290 Practice with the Pumping Lemma (Regular Languages) Show that each of the following length is at least p (the pumping ng languages are not regular, by finding an example of a string s whose g length), and for which no matter how we decompose it as xyz (with exponent i we can show that xy z is not in the language. not the length of xy less than p), for some for 1. A (wE (0,1). I the number of Os in w equals t we c the number of 1s in w) (Hint: try sO1P) 2. A (wwI wE (0,1)) the set of strings of Os and 1s whose form is akin to wallawalla or boutrosboutros or byebye (Hint: try s 0P101) CSCI 290 Practice with the Pumping Lemma (Regular 3. .the set of all palindones in (0,1). 4. A (1mom 1m