October 6, 2023

Theory-of-Computation

Question 13 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 […]
October 6, 2023

Theory-of-Computation

Question 5 Consider the language L = {an| n≥0} ∪ {anbn| n≥0} and the following statements. I. L is deterministic context-free. II. L is context-free but […]
October 6, 2023

Theory-of-Computation

Question 6 Consider the following statements. I. If L1 ∪ L2 is regular, then both L1 and L2 must be regular. II. The class of regular […]
October 6, 2023

Theory-of-Computation

Question 8 Which of the following languages are undecidable? Note that indicates encoding of the Turing machine M. L1 = | L(M) = Φ} L2 = […]
error: Alert: Content selection is disabled!!