COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
0 U 1
|
|
|
0 / 1
|
|
|
0 + 1
|
|
|
All of the mentioned
|
Detailed explanation-1: -1 Answer. Easiest explanation: All are equivalent to union operation.
Detailed explanation-2: -Every regular expression over 0, 1 is itself a string over the 8-symbol alphabet 0, 1, +, *, (, ), , Ø.
Detailed explanation-3: -Consider the regular expression (0|1)*. This stands for the set of all strings of binary digits. If we match this pattern against 0101B, there are 4 possible substrings it can match, namely 0, 01, 010, and 0101. Often we try to match the longest possible substring, in this case 0101.
Detailed explanation-4: -To answer your question, no. They are not the same.
Detailed explanation-5: -We say that two regular expressions R and S are equivalent if they describe the same language. In other words, if L(R) = L(S) for two regular expressions R and S then R = S. Examples.