Question

what is the number of states required in minimal DFA to accept the string of a regular language that contains exactly 2 A's and 3 b's over the input alphabet {a,b}​

Answer 1

Answer:

Language is consists of 12 length strings and to get one such string, we can choose any 5 spot for a's and rest 7 spot will be for b's. As we need ( 3 * 3 + 1 ) = 10 states for 2 a's and 2 b's.

Explanation:

Answer 2

Answer:

Language accepted by DFA

Contents

Here we are going to formally define what is meant by a DFA (deterministic finite automaton) accepting a string or a language.

A string w is accepted by a DFA < Q , , q0 , , A > , if and only if *( q0 , w ) A . That is a string is accepted by a DFA if and only if the DFA starting at the initial state ends in an accepting state after reading the string.language L is accepted by a DFA < Q , , q0 , , A > , if and only if L = { w | *( q0 , w ) A } . That is, the language accepted by a DFA is the set of strings accepted by the DFA.

Example 1 :

This DFA accepts {} because it can go from the initial state to the accepting state (also theinitial state) without reading any symbol of the alphabet i.e. by reading an empty string . It accepts nothing else because any non-empty symbol would take it to state 1, which is not an accepting state, and it stays there.

Explanation: