TOOLS AND TECHNIQUES FOR COMPILER DESIGN
MISCELLENOUS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
The minimum number of states required to recognize an octal number divisible by 3 are/is:
|
|
1
|
|
|
3
|
|
|
5
|
|
|
7
|
Explanation:
Detailed explanation-1: -Hence, the correct answer is option ‘B’, i.e., 3 states are required to recognize an octal number divisible by 3.
Detailed explanation-2: -3. Number of states require to accept string ends with 10. d) can’t be represented. Explanation: This is minimal finite automata.
Detailed explanation-3: -A string is a finite sequence of symbols selected from some alphabet. It is generally denoted as w. For example for alphabet ∑ = 0, 1 w = 010101 is a string. Length of a string is denoted as |w| and is defined as the number of positions for the symbol in the string.
There is 1 question to complete.