Question 12

How manystates are there in a minimum state deterministic finite automaton accepting the language $$L = \left\{w \mid w \in (0, 1)^*\right\}$$, {number of 0’s is divisible by 2 and numberof 1's is divisible by 5, respectively} ?


Create a FREE account and get:

  • Download Maths Shortcuts PDF
  • Get 300+ previous papers with solutions PDF
  • 500+ Online Tests for Free

cracku

Boost your Prep!

Download App