LEXICAL ANALYSIS
REGULAR EXPRESSIONS AND FINITE AUTOMATA
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
4
|
|
|
5
|
|
|
6
|
|
|
7
|
Detailed explanation-1: -Finite State Machine is defined formally as a 5‐tuple, (Q, , T, q0, F) consisting of a finite set of states Q, a finite set of input symbols , a transition function T: Q x →Q, an initial state q0 ∈ Q, and final states F ⊆ Q . FSM can be described as a state transition diagram.
Detailed explanation-2: -A finite-state machine is formally defined as a 5-tuple (Q, I, Z, ∂, W) such that: Q = finite set of states.
Detailed explanation-3: -Deterministic Finite Automata (DFA) DFA consists of 5 tuples Q, , q, F, .
Detailed explanation-4: -Finite Automata is the simplest machine to recognize patterns. Finite Automata consists of 5 tuples Q, , q0, F, . Q → set of all states.
Detailed explanation-5: -Each state can have either 0 or 1 & a Finite State Machine(FSM) can store only one bit at a time. The total no. of states required by Finite State Machine(FSM) is 2mn.