Reverse of (0+1)* will bea)Phib)Nullc)(0+1)*d)(0+1)Correct answer is o...
There is only one state which is start and final state of DFA so interchanging starting start and final state doesn’t change DFA.
View all questions of this test
Reverse of (0+1)* will bea)Phib)Nullc)(0+1)*d)(0+1)Correct answer is o...
Explanation:
To find the reverse of a regular language, we need to reverse all the strings in that language. In this case, the regular language is (0 1)*, which represents all possible combinations of 0s and 1s, including the empty string.
Reverse:
To reverse all the strings in the language (0 1)*, we need to reverse each individual string.
Reversing the strings:
Since the language (0 1)* includes the empty string, reversing it will still result in the empty string. Therefore, the reverse of the empty string is the empty string itself.
For the strings that are not empty, we reverse them by reversing the order of the characters. For example, the string "01" will be reversed to "10".
Reverse of (0 1)*:
Now, let's apply the reversal process to the language (0 1)*:
- The empty string is already in its reversed form, which is the empty string itself.
- The string "0" will be reversed to "0".
- The string "1" will be reversed to "1".
- The string "00" will be reversed to "00".
- The string "01" will be reversed to "10".
- The string "10" will be reversed to "01".
- The string "11" will be reversed to "11".
- and so on...
As we can see, the reversed strings are still in the language (0 1)* itself. So, the reverse of (0 1)* is (0 1)*.
Answer:
Therefore, the correct answer is option C, which is (0 1)*.