3 votes 3 votes The number of states in minimal DFA for strings starting with $ab^{2}$ and ending with $b$ over the alphabet $\left \{ a,b \right \}$ is__________. // doubt: minimal string should be $ abb $ right? Theory of Computation theory-of-computation number-of-states minimal-state-automata + – Devwritt asked Dec 13, 2018 edited Dec 13, 2018 by srestha Devwritt 1.5k views answer comment Share Follow See all 23 Comments See all 23 23 Comments reply Show 20 previous comments altamash commented Dec 27, 2018 reply Follow Share 5 state = 4 for abb and 1 reject state if it start from b 0 votes 0 votes Shiva Sagar Rao commented Apr 28, 2021 reply Follow Share Duplicate: https://gateoverflow.in/278153/me-test-series-dfa-states 0 votes 0 votes Hira Thakur commented Dec 1, 2021 reply Follow Share Utkarsh Joshi your DFA is invalid for strings like $abbaabb,abbaabbb,abbbab$. for the final state on input, $b$ self-loop is there. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes answer is 6 , edit: yeah the smallest string is abb rballiwal answered Dec 14, 2018 rballiwal comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes RE = abb + abb(a+b) *b Draw a DFA for above Regular Expression (key point is : smallest string will be 'abb') Devwritt answered Dec 19, 2018 Devwritt comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes 5 state is required abhishekmehta4u answered Mar 30, 2019 abhishekmehta4u comment Share Follow See 1 comment See all 1 1 comment reply rishu1812 commented Apr 15, 2020 reply Follow Share your dfa is excepting abab, which do not start with abb. 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes 6 states required as ab2 requires 4 states and b requires one state and one dead state 2021 answered Dec 1, 2021 2021 comment Share Follow See all 0 reply Please log in or register to add a comment.