A minimum state deterministic finite automaton accepting the language L={w | w…
PYQ GATE 2007
A minimum state deterministic finite automaton accepting the language L={w | w ε {0,1} *, number of 0s and 1s in w are divisible by 3 and 5, respectively} has
- A.
15 states
- B.
11 states
- C.
10 states
- D.
9 states
Attempted by 888 students.
Sign up free to check your answer
Sign up freeLoading lesson…

