Question 2 Which one of the following statements is FALSE? A There exist context-free languages such that all the context-free grammars generating them are ambiguous B […]

Question 24 Consider the following languages. L1 = {wxyx | w,x,y ∈ (0 + 1)+} L2 = {xy | x,y ∈ (a + b)*, |x| = […]

Question 23 Which of the following statements is/are TRUE? A Every subset of a recursively enumerable language is recursive. B If a language L and its […]

Question 2 Which of the following is/are undecidable? A Given two Turing machines M1 and M2, decide if L(M1)=L(M2). B Given a Turing machine M, decide […]