February 27, 2025

Theory-of-Computation

Question 2 Consider the pushdown automaton (PDA) P below, which runs on the input alphabet {a, b}, has stack alphabet {⊥, A}, and has three states […]
March 12, 2025

GATE 2005

Question 45 Consider three decision problems P1, P2 and P3. It is known that P1 is decidable and P2 is undecidable. Which one of the following […]
March 12, 2025

GATE 2006

Question 85 In the correct grammar of above question, what is the length of the derivation (number of steps starting from S) to generate the string […]
March 12, 2025

GATE 2006

Question 84 Which one of the following grammars generates the language L = {aibj|i≠j}? A S→AC|CB C→aCb|a|b A→aA|ϵ B→Bb|ϵ B S→aS|Sb|a|b C S→AC|CB C→aCb|ϵ A→aA|ϵ B→Bb|ϵ […]