Question 13 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 […]

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

Question 25 Which of the following languages are undecidable? Note that indicates encoding of the Turing machine M. L1 = | L(M) = Φ} L2 = […]