TOOLS AND TECHNIQUES FOR COMPILER DESIGN
MISCELLENOUS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
01, 0011, 010101
|
|
|
0011, 11001100
|
|
|
, 0011, 11001100
|
|
|
, 0011, 11001100
|
Detailed explanation-1: -The non-Kleene Star operation accepts the following string of finite length over set A = 0, 1 | where string s contains even number of 0 and 1a)01, 0011, 010101b)0011, 11001100c), 0011, 11001100d), 0011, 11001100Correct answer is option ‘B’. Can you explain this answer?
Detailed explanation-2: -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.
Detailed explanation-3: -According to the question, minimum of 3 states are required to recognize an octal number divisible by 3.
Detailed explanation-4: -Therefore, option ‘D’ is not a part of 5-tuple finite automata as it does not have any output alphabet. The machine only reads input symbols and goes through states to either accept or reject the input.