COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
’ (S, a) =Ups (p, a)
|
|
|
’ (S, a) =Up≠s (p, a)
|
|
|
’ (S, a) =Ups (p)
|
|
|
’ (S) =Up≠s (p)
|
Detailed explanation-1: -In a DFA, the transition function always returns a single state; in an NFA, the transition function returns a set of states, which could be empty, or all of Q, or anything in between. ∗(r, x) if w = ax. The NFA (Q, , , s, A) accepts w ∈ ∗ if and only if ∗(s, w) ∩ A = ∅.
Detailed explanation-2: -Delta ( ) is a transition function from Qx to the powerset of Q. Transition function takes two arguments: a state and an input symbol. (q, a) = the set of the states that the DFA goes to when it is in state q and input a is received.
Detailed explanation-3: -Formal Definition of a DFA ∑ is a finite set of symbols called the alphabet. is the transition function where : Q × ∑ → Q. q0 is the initial state from where any input is processed (q0 ∈ Q). F is a set of final state/states of Q (F ⊆ Q).
Detailed explanation-4: -On the basis of computational power DFA and NFA are both equally powerful. Since, we have algorithm to convert NFA to DFA, and DFA is by default an NFA, both of them have equal computational power.