Question 9089 – GATE 2009
February 10, 2024Question 4446 – ICT
February 10, 2024Question 9094 – GATE 2009
Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?
Correct Answer: C
Question 15 Explanation:
Option A is false, as the regular expression generates string “010” which doesn’t have “00” as substring. Option B is false, as we can have the string “000” from the given regular expression, which has more than two 0’s. Option D is false, as we cannot generate the string “01” from the given regular expression and according to option D, string “01” must be generated by regular expression, which clearly shows option D is not correct language as per regular expression.
The set of all strings containing the substring 00.
The set of all strings containing at most two 0’s.
The set of all strings containing at least two 0’s.
The set of all strings that begin and end with either 0 or 1.
Subscribe
Login
0 Comments