Home »
MCQs »
Theory of Computation MCQs
What will be the regular expression for the language accepting all the strings which are starting with 1 and ending with 0, over ∑ = {0, 1}?
33. What will be the regular expression for the language accepting all the strings which are starting with 1 and ending with 0, over ∑ = {0, 1}?
- R = 1 (0+1)* 1
- R = 1 (0+1)+ 0
- R = 1 (0+1)* 0
- R = 1 (0+1)+1
Answer: C) R = 1 (0+1)* 0
Explanation:
The initial symbol in a regular expression should be 1, and the last symbol should be 0, so the regular expression will be R = 1 (0+1)* 0.