7 votes 7 votes The following Finite Automaton recognizes which of the given languages? $\{ 1, 0 \}^* \{ 0 1 \}$ $\{ 1,0\}^*\{ 1\}$ $\{ 1 \} \{1, 0\}^*\{ 1 \}$ $1^*0^*\{0,1\}$ GATE finite-automata isro2014 + – naga praveen asked Jun 13, 2016 naga praveen 5.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Smallest string accept by the NFA is 01. In option b,c and d . Does not gives smallest string 01 . So it is clearlly false. But in option a smallest string is 01 . So it is true abhishekmehta4u answered Mar 29, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.