What is the relation between DFA and NFA on the basis of computational

1.	What is the relation between DFA and NFA on the basis of computational power?
A.	DFA > NFA
B.	NFA > DFA
C.	Equal
D.	Can‚Äö√Ñ√∂‚àö√ë‚àö¬•t be said
Answer» D. Can‚Äö√Ñ√∂‚àö√ë‚àö¬•t be said

Discussion

No Comment Found

Related MCQs

Predict the missing procedure: 1.Δ(Q0, ε) ={Q0},2.Δ(Q0, 01) = {Q0, Q1}3.δ(Q0, 010) =?
Number of times the state q3 or q2 is being a part of extended 6 transition state is
From the given table, δ*(q0, 011) =?
According to the given table, compute the number of transitions with 1 as its symbol but not 0:
If a string S is accepted by a finite state automaton, S=s1s2s3……sn where siϵ∑ and there exists a sequence of states r0, r1, r2…… rn such that δ(r(i), si+1) =ri+1 for each 0, 1, …n-1, then r(n) is:
If δ is the transition function for a given NFA, then we define the δ’ for the DFA accepting the same language would be:Note: S is a subset of Q and a is a symbol.a) δ’ (S, a) =Upϵs δ (p, a)b) δ’ (S, a) =Up≠s δ (p, a)c) δ’ (S,
What is wrong in the given definition?Def: ({q0, q1, q2}, {0,1}, δ, q3, {q3})
Choose the correct option for the given statement:Statement: The DFA shown represents all strings which has 1 at second last position.
If a string S is accepted by a finite state automaton, S=s1s2s3‚Äö√Ñ√∂‚àö√ë¬¨‚àÇ‚Äö√Ñ√∂‚àö√ë¬¨‚àÇsn where si‚âà√¨¬¨¬µ‚Äö√Ñ√∂‚àö‚Ä†‚àö¬¥ and there exists a sequence of states r0, r1, r2‚Äö√Ñ√∂‚àö√ë¬¨‚àÇ‚Äö√Ñ√∂‚àö√ë¬¨‚àÇ rn such that ‚âà√≠¬¨‚Ä¢(r(i), si+1) =ri+1 for each 0, 1, ‚Äö√Ñ√∂‚àö√ë¬¨‚àÇn-1, then r(n) is:$
What is the relation between DFA and NFA on the basis of computational power?

What is the relation between DFA and NFA on the basis of computational power?

Discussion

No Comment Found

Related MCQs

Reply to Comment