1,385 views

1 Answer

3 3 votes

i think 

Here Qo is initial state as well as final state . so ans is B.

Position:
Show:

Related questions

0 0 votes
1 1 answer
695
695 views
cse23 asked Jan 19, 2017
695 views
can we say languages which are not R.E as undecidable but partially decidable??example:sigma={0,1] and L={<M>| M is a TM that accepts a string of length 2014 } a/c to ric...
1 1 vote
1 answers 1 answer
1.7k
1.7k views
shreshtha5 asked Jul 11, 2015
1,702 views
let q0 and q1 are two states and q0 is always initial state over the alphabet {a,b}, the possible number of dfa's with two states q0 and q1 are16,32,64,80
2 2 votes
3 answers 3 answers
6.1k
6.1k views
shreshtha5 asked Apr 26, 2015
6,145 views
the minimum number of states in the PDA accepting the language$L=\left\{a^n b^m \mid n>m;m,n>0 \right\}$a) 2b) 3c) 4d) 5
0 0 votes
2 answers 2 answers
682
682 views
Hcas Hgnis asked Dec 7, 2014
682 views