COMPUTER SCIENCE AND ENGINEERING
COMPILER DESIGN
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
∑, Q,
|
|
|
Q,
|
|
|
, Q,
|
|
|
F, Q, ,
|
Detailed explanation-1: -NDFA accepts the NULL move, which means it can change the state without reading the symbols. NFA consists of 5 tuples Q, , q, F, . Q: a set of all states. F: a set of the final state.
Detailed explanation-2: -Definition: A nondeterministic finite automaton (NFA) is a 5-tuple (Q, , , q0, F), where Q, , q0, and F are defined as they are for a DFA, and is defined as: : Q × ( ∪ ) → P(Q)–a function from a state and alphabet symbol to a set of states that is a member of P(Q), the power set of Q.
Detailed explanation-3: -A DFA is a collection of 5-tuples same as we described in the definition of FA. Transition function can be defined as: : Q x ∑→Q.
Detailed explanation-4: -A deterministic finite automaton (DFA) is a 5-tuple. (Q, , , q0, F), where. Q is a finite set called the states, is a finite set called the alphabet, : Q × → Q is the transition function, q0 ∈ Q is the start state, and F ⊆ Q is the set of accept states.