LEXICAL ANALYSIS
REGULAR EXPRESSIONS AND FINITE AUTOMATA
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Q X
|
|
|
Q X
|
|
|
Q X
|
|
|
Q X
|
Detailed explanation-1: -More formally, the transition function in an NFA with -transitions has a slightly larger domain : Q × ( ∪ ) → 2Q. The -reach of a state q ∈ Q consists of all states r that satisfy one of the following conditions: 4 either r = q, 4 or r ∈ (q, ) for some state q in the -reach of q.
Detailed explanation-2: -3. What is the transitional function of an NFA? Explanation: Let Q be a finite set and let be a finite set of symbols. Also let be a function from Q to 2Q.
Detailed explanation-3: -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.
Detailed explanation-4: -In automata theory and sequential logic, a state-transition table is a table showing what state (or states in the case of a nondeterministic finite automaton) a finite-state machine will move to, based on the current state and other inputs.