retagged by
16,385 views
47 votes
47 votes
The minimum possible number of states of a deterministic finite automaton that accepts the regular language $L$ = {$w_{1}aw_{2}$ | $w_{1},w_{2}$ $\in$ $\left \{ a,b \right \}^{*}$ , $\left | w_{1} \right | = 2, \left | w_{2} \right |\geq 3$} is ______________ .
retagged by

9 Answers

Best answer
90 votes
90 votes

Answer is 8 states included one trap state (8) and final state (7).

$3^{rd}$ symbol from the start is an $\textbf{a}$
edited by
22 votes
22 votes
(a+b)(a+b)a(a+b)(a+b)(a+b) min length string is 6 alphabet so we need atleast 7 state and one for dead state so tatal 8 state needed.
reshown by
6 votes
6 votes
The answer will be 8 here

|w1| =2 for this we need 4 states (One dead state also)

|w2| >=3 for this we need 3 states

and 1 state in the middle for a so total 8
Answer:

Related questions

54 votes
54 votes
15 answers
1
77 votes
77 votes
12 answers
2
Arjun asked Feb 14, 2017
28,051 views
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$-NFA whose transition table is given below:$$\...
38 votes
38 votes
5 answers
3
Akash Kanase asked Feb 12, 2016
15,610 views
The number of states in the minimum sized DFA that accepts the language defined by the regular expression.$(0+1)^{*} (0+1) (0+1)^{*}$is ________.
36 votes
36 votes
6 answers
4
go_editor asked Feb 13, 2015
15,514 views
The number of states in the minimal deterministic finite automaton corresponding to the regular expression $(0+1)^* (10)$ is _____.