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

Theory of computation miscellaneous

Theory of Computation

  1. The number of states in the minimum sized DFA that accepts the language defined by the regular expression (0 + 1) * (0 + 1) (0 + 1)* is ________.
    1. 0
    2. 1
    3. 2
    4. 3
Correct Option: C


So, the minimum number of states is 2.



Your comments will be displayed only after manual approval.