The total number of states to build the given language using DFA L w w has

The total number of states to build the given

This preview shows page 61 out of 61 pages.

10. The total number of states to build the given language using DFA:L= {w | w has exactly 2 a’s and at least 2 b’s}a) 10b) 11c) 12d) 13View AnswerAnswer: aExplanation: We need to make the number of a as fixed i.e. 2 and b can be 2 or more. Thus, using thiscondition a finite automata can be created using 1 states.
Background image

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture