![GATE 2014 [Set-3]](https://solutionsadda.in/wp-content/uploads/2019/05/green-new-logo.png){kind=logo}
April 2, 2025
Question 46 Consider the following languages over the alphabet Σ = {0,1,c}: L1 = {0n1n | n≥0} L2 = {wcwr | w∈{0,1}*} L3 = {wwr | […]
April 2, 2025
Question 47 Suppose you want to move from 0 to 100 on the number line. In each step, you either move right by a unit distance […]
April 4, 2025
Question 34 Consider the following statements: I. The complement of every Turning decidable language is Turning decidable II. There exists some language which is in NP […]
April 4, 2025
Question 48 Consider the decision problem 2CNFSAT defined as follows: {Φ|Φ is a satisfiable propositional formula in CNF with atmost two literals per clause} For example, […]