2 votes 2 votes The minimum number of states in an equivalent finite automata for the given regular expression are _____ (a(a(a(a(a(ab)*b)*b)*b)*b)*b)* Theory of Computation theory-of-computation regular-expression regular-language finite-automata + – coder97 asked Oct 5, 2021 coder97 666 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes (a(a(a(a(a(ab)*b)*b)*b)*b)*b)* Total 8 states are there in the DFA of the given regular expression. Vishal_kumar98 answered Oct 8, 2021 Vishal_kumar98 comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Minimum 7 states required. Aashay kaurav answered Oct 6, 2021 Aashay kaurav comment Share Follow See all 2 Comments See all 2 2 Comments reply sayan_exe commented Oct 23, 2021 reply Follow Share How please prove 0 votes 0 votes Aashay kaurav commented Oct 23, 2021 reply Follow Share In the question we are asked for Finite automata means bydefault it’s NFA. Therefore we can ignore dead state. So only 7 states are required. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Total states that are possible is 8. virusbug answered Nov 13, 2021 virusbug comment Share Follow See all 0 reply Please log in or register to add a comment.