1
Question
Consider the following regular expressions over {0, 1} respectively.
I. 101 (0 + 1)* 101
II. 101 (0 +1) * 101 + (10)21
III. 101 (0 + 1)*
Which of the above regular expression(s) correctly generate the set of all binary strings starting and ending with 101?
Consider the following regular expressions over {0, 1} respectively.
I. 101 (0 + 1)* 101
II. 101 (0 +1) * 101 + (10)21
III. 101 (0 + 1)*
Which of the above regular expression(s) correctly generate the set of all binary strings starting and ending with 101?
Open in App
Solution
The correct option is A None of these
None of these regular expressions generate the required language. For example,the regular expressions I and II do not generate the string 101, which also starts and ends with 101. However the third regular expression actually generates a superset of the required language and thus some non members which do not end with 101 are also generated. Hence option D is the most appropriate choice. And it's good to know that the correct regular expression for the specification given will be 101 (0 + 1)* 101 + 101 + 10101
None of these regular expressions generate the required language. For example,the regular expressions I and II do not generate the string 101, which also starts and ends with 101. However the third regular expression actually generates a superset of the required language and thus some non members which do not end with 101 are also generated. Hence option D is the most appropriate choice. And it's good to know that the correct regular expression for the specification given will be 101 (0 + 1)* 101 + 101 + 10101
Suggest Corrections
0
Similar questions
Join BYJU'S Learning Program
Join BYJU'S Learning Program
