April 5, 2025

Nielit Scientist-B CS 4-12-2016

Question 3 If L1 is CSL and L2 is regular language which of the following is false? A L1-L2 is not context free B L1 intersection […]
April 5, 2025

Nielit Scientist-B CS 4-12-2016

Question 6 Which of the following is TRUE? A Turing machine is a simple mathematical model of general purpose computer B Turing machine is more powerful […]
April 6, 2025

GATE 2010

Question 39 Let L = {w ∈ (0 + 1)* | w has even number of 1s}, i.e. L is the set of all bit strings with even […]
April 6, 2025

GATE 2006

Question 33 Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, but not recursive, language. Which one of […]