Question 3578 – Theory-of-Computation
December 2, 2023Question 5155 – UGC NET CS 2018 JUNE Paper-2
December 2, 2023Question 3684 – Theory-of-Computation
The number of strings of length 4 that are generated by the regular expression (0|∈)1 + 2* (3|∈), where | is an alternation character, {+, *} are quantification characters, and ∈ is the null string, is :
Correct Answer: D
Question 415 Explanation:
Possible strings of length 4 generated by given regular expression are:
1111, 0111, 1112, 0122, 0123, 1222, 1223, 0122, 0113, 1123, 0112, 1113.
So, total 12 strings of length 4 are possible.
1111, 0111, 1112, 0122, 0123, 1222, 1223, 0122, 0113, 1123, 0112, 1113.
So, total 12 strings of length 4 are possible.
08
10
11
12
Subscribe
Login
0 Comments