LEXICAL ANALYSIS
CONSTRUCTION OF A LEXICAL ANALYZER
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
The minimum number of states required in a DFA (along with a dumping state) to check whether the 3rd bit is 1 or not for |n|>=3, where n is number of bits.
|
|
3
|
|
|
4
|
|
|
5
|
|
|
1
|
Explanation:
Detailed explanation-1: -The minimum number of states is 4.
Detailed explanation-2: -The finite automaton accepting nothing will contain transitions on all input symbols to itself only. Thus atleast 1 state is necessarily required.
Detailed explanation-3: -Explanation: The DFA can be minimized to two states and the second state is final state .
There is 1 question to complete.