36 votes 36 votes The number of states in the minimal deterministic finite automaton corresponding to the regular expression $(0+1)^* (10)$ is _____. Theory of Computation gatecse-2015-set2 theory-of-computation finite-automata normal numerical-answers minimal-state-automata + – go_editor asked Feb 13, 2015 • retagged Jul 1, 2017 by Silpa go_editor 15.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes No. of states in minimal DFA is 3. varunrajarathnam answered Aug 23, 2020 varunrajarathnam comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes make NFA, then convert to DFA, simply see 3 states, you cannot reduce it further shashankrustagi answered Jan 17, 2021 shashankrustagi comment Share Follow See all 0 reply Please log in or register to add a comment.