The GATE Grind

GATE 2007 CS – Question 29

Theory of Computation · Regular Expressions and Finite Automata · 2 marks · Multiple choice

What is the minimum DFA size for binary strings whose number of0s is divisible by3 and number of1s divisible by5?

  1. 15 states
  2. 11 states
  3. 10 states
  4. 9 states

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (A) 15 states

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Regular Expressions and Finite Automata questions

All Regular Expressions and Finite Automata questions →