Home » Theory of Computation » Theory of computation miscellaneous » Question

Theory of computation miscellaneous

Theory of Computation

  1. Which of the regular expressions given below represent the following DFA?

    I 0*1(1+00*1)*
    II 0*1*1+11*0*1
    III (0+1)*1
    1. I and II only
    2. I and III only
    3. II and III only
    4. I, II, and III
Correct Option: B

(I) 0 *1(1 + 0 0 *1)*
(II) 0 *1*1+11*0 *1
(III) (0 +1)*1
(I) and (III) represent DFA.
(II) Doesn't represent as the DFA accepts strings like 11011, but the given regular expression doesn't accept.



Your comments will be displayed only after manual approval.