2.2 > a. Use the languages A = {a"b"c"|m, n ≥ 0} and B = {a"b" cm, n ≥ 0} together with Example 2.36 to show that the class of context-free languages. is not closed under intersection. b. Use part (a) and DeMorgan's law (Theorem 0.20) to show that the class of context-free languages is not closed under complementation.

Question 34 The correct statements are: Decidable languages are closed under union. Decidable languages are closed under intersection. Decidable languages are closed under complement. Semi-decidable languages are closed under complement.

Computer Science In function f(x) ->y the domain of x is continuous in the range 1-10how many equivalence classes are there in this case?

Use the Pumping Lemma to prove that the language L (a"b2n :n >= 0} is NOT context free.

Prove that the following language is regular.L = {x | x ∈ {0, 1}∗, x does not contain five consecutive 0's or five consecutive 1's}Hint: You may take advantage of some closure properties.

29 of 40 Suppose R(A, B, C) contains the tuples {(a1,b1,c1), (a2,b1,c1), (a3,b1,c1), (a2, b2, c2) (a3,b3,c3), (a4,b3,c3), (a5,b5,c5), (a6,b5,c5)} and S(B, C, D, E) contains the tuples {(b1,c1,d1,e1),(b1,c1,d1,e2), (b2,c2,d2,e2), (b3,c3,d3,e3), (b3,c3,d4,e4), (b6,c6,d1,e1)} The following SQL query will return how many tuples? Select * From Rr FULL OUTER JOIN S s ON r.B= s.B AND r.C=s.C; Answer:

For each question, build a possibly nondeterministic FSM for the given language.

55. Find a deterministic finite-state automaton that recog- nizes each of these sets. b) {1, 00} a) {0} c) {1" | n = 2, 3, 4, ...} 56. Find a nondeterministic finite-state automaton that recog- nizes each of the languages in Exercise 55, and has fewer states, if possible, than the deterministic automaton you found in that exercise.

Can you please help me with question 2.7 part B because I am struggling with this problem that I just don't understand. Can you please do a state diagram for the push down automaton for part B. question for 2.7 2.7 Give informal English descriptions of PDAs for the language. B. The complement of the language {a^n b^n | n ≥ 0}

(I) State the pumping lemma with all its conditions and indicate how you go about proving that a language is not regular. (II) If the languages are regular, give an automaton. Otherwise, show it is not regular by using pumping lemma. L= {b²anbma³ | m, n ≥ 0}. L = {b²anbma³ | m = n}. L = {ww|w is any string over {a.b}} L = {a³b4} L= {anbn+1} L = {ambnamn | m,n≥ 0 }