LEXICAL ANALYSIS
REGULAR EXPRESSIONS AND FINITE AUTOMATA
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Given Language:{x | it is divisible by 3} The total number of final states to be assumed in order to pass the number constituting {0, 1} is
|
|
0
|
|
|
1
|
|
|
2
|
|
|
3
|
Explanation:
Detailed explanation-1: -This is because if the input sequence is divisible by 3, it will end up in either q0 or q1, and these states produce an output. Therefore, the total number of final states to be assumed in order to pass the number constituting 0, 1 is 2, which is option C.
There is 1 question to complete.