December 6, 2023Theory-of-ComputationQuestion 33 Which of the following statements is false? A The Halting problem of Turing machines is undecidable. B Determining whether a context-free grammar is ambiguous […]
December 6, 2023Theory-of-ComputationQuestion 36 Let L ⊆ Σ* where Σ = {a, b}. Which of the following is true? A L = {x|x has an equal number of […]
December 6, 2023GATE 1996Question 33 If L1 and L2 are context free languages and R a regular set, one of the languages below is not necessarily a context free […]
December 6, 2023Theory-of-ComputationQuestion 33 Define for a context free language L ⊆ {0,1}*, init(L) = {u ∣ uv ∈ L for some v in {0,1}∗} (in other words, […]