COMPUTER SCIENCE AND ENGINEERING
COMPILER DESIGN
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Q X
|
|
|
Q X
|
|
|
Q X
|
|
|
Q X
|
Detailed explanation-1: -The transition function is also called a next state function meaning that the automaton moves into the state (q, a) if it receives the input symbol a while in state q. Thus in the example of vending machine, if q is the initial state and a nickel is put in, then (q, a) is equal to “have received 5 cents".
Detailed explanation-2: -2. What is the transitional function of a DFA? Explanation: Q is the finite set and let be a finite set of symbols so Q X fives no of states.
Detailed explanation-3: -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-4: - is the transition function. Here it maps Q × ∑ → Q. q0 is the initial state or the start state from where any input is first given or is being processed (q0 ∈ Q). F is a set of final state/states of Q (F ⊆ Q).