please help, will upvote Form lang and auto theory, please explain why is true or not Select all the statements below which are True: O dpda's can use X- transitions. O The language L = {ww" : w E {a,...

Extracted text: please help, will upvote Form lang and auto theory, please explain why is true or not Select all the statements below which are True: O dpda's can use X- transitions. O The language L = {ww" : w E {a, b}*}is accepted by some dpda. O npda's and dpda'a are equivalent. O Each regular language is accepted by some dpda. O Let E {a, b, c}. The language L = {uu: u E {a, b, c}*} is a context-free language. O A npda has at most one transition for any combination of input symbol and stack symbol. O Each context-free language is accepted by some dpda. O A dpda M cannot contain both the transitions 8 (q, b, a) = {(q1, A)} and 8 (q, A, a) = {(q2, aa)}. %3D