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 ______________ . Theory of Computation theory-of-computation regular-expression minimal-state-automata + – iarnav asked Aug 24, 2017 iarnav 1.1k views answer comment Share Follow See 1 comment See all 1 1 comment reply Hemant Parihar commented Aug 24, 2017 reply Follow Share 8 Total states among them 4 are final states. 1 votes 1 votes Please log in or register to add a comment.
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 Warlock lord answered Aug 24, 2017 Warlock lord comment Share Follow See all 2 Comments See all 2 2 Comments reply Hira Thakur commented Aug 26, 2017 reply Follow Share Can u show yr DFA? 0 votes 0 votes Warlock lord commented Aug 26, 2017 reply Follow Share Forgive me for the terrible diagram. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Final states. 4 Total no. Of states is 8 Kajal chauhan14 answered Oct 1, 2020 Kajal chauhan14 comment Share Follow See all 0 reply Please log in or register to add a comment.