GATE CS 2007 — Question 31

Multiple choice 2 marks Question 31 2007

Question 31

MCQ 2 marks · −0.66 Theory of Computation

A minimum state deterministic finite automaton accepting the language \(L = \{w \mid w \in \{0,1\}^*\), number of 0s and 1s in \(w\) are divisible by 3 and 5, respectively\(\}\) has

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

Where this question comes from

GATE CS — Computer Science & IT 2007 Theory of Computation

Source: GATE 2007 Computer Science and Engineering, Q31 (question number approximate)

All Theory of Computation questions