The Gateway to Engineering Excellence
0 votes
19 views

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)^*$?

  1. The set of all strings containing the substring $00$
  2. The set of all strings containing at most two $0$'s
  3. The set of all strings containing at least two $0$'s
  4. The set of all strings that begin and end with either $0$ or $1$
in Theory of Computation by (185 points) 2 7 | 19 views

Please log in or register to answer this question.

Top Users Mar 2019
  1. gatefan

    185 Points

  2. southdelhi

    152 Points

  3. gfjacob

    102 Points

  4. 1995ankur

    100 Points

  5. mohan

    100 Points

₹ 500 Amazon Gift Card for Monthly top user

Recent Badges

Trouper gfjacob
Visitor gfjacob
Regular southdelhi
Verified Human gfjacob
100 Club gfjacob
100 Club 1995ankur
16 questions
0 answers
0 comments
75 users