Question

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

• A. 9 states
• B. 15 states
• C. 11 states
• D. 10 states

Answer 1

The correct option is B 15 states

$L=\{w\mid sϵ{\{0,1\}}^{\ast }numberif{0}^{\prime }sand{1}^{\prime }sinwaredivisibleby3and5respectively\}$

The minimum state determinitic finite automation accepting the language L has 3 $\times$ 5 = 15 states.