1,140 views
3 votes
3 votes
The minimum possible number of states and number of final states of a DFA that accepts the regular language $L = \{w_1aw_2 \mid w_1,w_2 ∈ \{a,b\}^∗, |w_1|=2,|w_2|\leq 3\}$ is ______________ .

2 Answers

0 votes
0 votes

This will have 8 states in all (including a trap state) and has 4 final states.

You may refer to this regex:

(a+b)(a+b)a(a+b)?(a+b)?(a+b)?

'?' means 0 or 1 since  |w2| <=3 

Related questions

1 votes
1 votes
1 answer
1
sripo asked Nov 6, 2018
2,973 views
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?
0 votes
0 votes
2 answers
2
iarnav asked Mar 14, 2019
863 views
Given L = { 0*1 + 0 + 1* + 10*1}where + symbol is UNION and NOT positive closure.Please draw the Minimal DFA for this.