## Discussion Forum

Que. | Consider a DFA over ∑ = {a, b} accepting all strings which have number of a’s divisible by 6 and number of b’s divisible by 8. What is the minimum number of states that the DFA will have? |

a. | 8 |

b. | 14 |

c. | 15 |

d. | 48 |

Answer:48 |