GATE CS 2015 Set 1 — Question 23

Multiple choice 2 marks Question 23 2015

Question 23

MCQ 2 marks · −0.66 Theory of Computation

Let \(L\) be the language represented by the regular expression \(\Sigma^*0011\Sigma^*\), where \(\Sigma = \{0,1\}\). What is the minimum number of states in a DFA that recognizes \(\bar{L}\) (complement of \(L\))?

Answers and explanations are free — they just need an account.

Where this question comes from

GATE CS — Computer Science & IT 2015 Theory of Computation

Source: GATE 2015 Computer Science and Information Technology, Set 1, Q23 (question number approximate)

All Theory of Computation questions