TOOLS AND TECHNIQUES FOR COMPILER DESIGN
MISCELLENOUS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
The number of elements in the set for the Language L={x(∑r) *|length if x is at most 2} and ∑={0, 1} is ____
|
|
7
|
|
|
6
|
|
|
8
|
|
|
5
|
Explanation:
Detailed explanation-1: -Let |X| denotes the number of elements in a set X. Let S=1, 2, 3, 4, 5, 6 be a sample space, where each element is equally likely to occur. If A and B are independent events associated with S, then the number of ordered pairs (A, B) such that 1≤|B|<|A|, equals.
Detailed explanation-2: -Explanation: The maximum number of final states for a DFA can be total number of states itself and minimum would always be 1, as no DFA exits without a final state. Therefore, the solution is n+1.
There is 1 question to complete.