0 votes 0 votes Find the minimum number of states in the DFA which accept the language of all strings that begin or end with 00 or 11. Theory of Computation finite-automata number-of-dfa minimal-state-automata + – kumar.dilip asked Jan 19, 2019 kumar.dilip 790 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Shubhanshu commented Jan 19, 2019 reply Follow Share I am getting 8 stages in which it has 3 final state. 1 votes 1 votes kumar.dilip commented Jan 19, 2019 reply Follow Share Shubhanshu correct!!. Please explain ?? 0 votes 0 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes Here it is!!! Shubhanshu answered Jan 19, 2019 • selected Jan 19, 2019 by kumar.dilip Shubhanshu comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Shubhanshu commented Jan 19, 2019 reply Follow Share Thanks alot @kumar.dilip . Any further changes are most welcome. 0 votes 0 votes kumar.dilip commented Jan 19, 2019 reply Follow Share Shubhanshu I think we can merge two final states of 00(0+1)* + 11(0+1)*.into one. So, the total number of states will be 8. Thanks. 0 votes 0 votes Shubhanshu commented Jan 19, 2019 reply Follow Share Yeah. Thanks. 0 votes 0 votes Please log in or register to add a comment.
