LEXICAL ANALYSIS
REGULAR EXPRESSIONS AND FINITE AUTOMATA
|
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: -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-3: -Previous Page. In NDFA, for a particular input symbol, the machine can move to any combination of the states in the machine. In other words, the exact state to which the machine moves cannot be determined. Hence, it is called Non-deterministic Automaton.
Detailed explanation-4: -A Deterministic Finite Automaton (DFA) is defined as a 5-tuple (Q, , , s, F) consisting of. A finite set Q (the set of states) A finite set of symbols (the input alphabet) A transition function : Q × → Q mapping the current state q ∈ Q and input symbol a ∈ to a new state (q, a) ∈ Q.