GATE 2015 · Set-1
The number of states in the minimal deterministic finite automaton (DFA) accepting the language L = {w in {0, 1}* | w contains '01' as a substring} is
Related Theory of Computation PYQs
For any two languages L1 and L2 such that L1 is context-free and L2 is recursively enumerable but not recursive, which of the foll…
Consider the languages L1 = {a^n b^m c^n+m | n, m >= 1} and L2 = {a^n b^m | n, m >= 0}. Which of the following statements is TRUE?
For any two languages L1 and L2 such that L1 is context-free and L2 is recursively enumerable but not recursive, which of the foll…
See the question below and answer
GATE 2015 CS - Set 2 - Question 20: see question below and answer
GATE 2015 CS - Set 2 - Question 45: see question below and answer
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
Saved progressKeep answers, mock results and completion history across devices.
Adaptive practiceGet questions matched to your recent accuracy and difficulty level.
Bookmarks and notesBuild a personal revision list and record why a question was difficult.
Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.