edited by
20,949 views

7 Answers

Best answer
61 votes
61 votes
  1. Begin either with $0$ or $1$ 
    Regular expression $:(0+1)(0+1)^*$
  2. End with $0$
    Regular expression $: (0+1)^*0$

     

     

  3. End with $00$
    Regular expression $:(0+1)^*00$
       

     

  4. Containing the substring $00$
    Regular expression $: (0+1)^*00(0+1)^*$         
     

 

So, C is the correct answer.

edited by
22 votes
22 votes
1. begin either with 0 or 1  contain '0' and '1' which is not accepted so false

2. end with 0 contain  '110' which  is not accepted.so false

3. end with 00 contain True here

4. contain the substring 00. contain 00101 which is not accepted i.e. take  any string conatin  the substring 00 and end with 1. so false

so c is answer

10 votes
10 votes
I'll prove it by taking 'false string'

A: Begin with '0' or '1' False String: 11,111,etc.

B: End with '0'  False String: 10,110,etc.

D: Contain substring '00': 1001,10001,etc.

So remaining option is C
Answer:

Related questions

34 votes
34 votes
7 answers
4
Kathleen asked Sep 22, 2014
20,203 views
$$S \to aSa \mid bSb\mid a\mid b$$The language generated by the above grammar over the alphabet $\{a,b\}$ is the set of:all palindromesall odd length palindromesstrings t...