3,751 views
2 2 votes

Let L={w| w has even length and odd number of 0’s}. Which of the following words is in L* (Kleen Closure of L).

  1. 0000
  2. 010101
  3. 111101
  4. 010

 Answer Is Given 0000

 

1 Answer

Best answer
5 5 votes

The correct answer is option B.

L ={ 01,10,….}

L^2=L.L={01,10,….}.{01,10,…..}

L^2={0101,0110,1001,1010,…….}

L^3=L^2.L={0101,0110,1001,1010…..}.{01,10,….}

 L^3   ={010101,010110,100101,…..}

L*=L^0 U L^1 U L^2 U L^3….

so definitely the string 010101 will be there.

Now 0000 can never be generated as 

for 0000 which has length 4 we have to concat with 

  1. length 0 + length 4
  2. length 1+  length 3
  3. length 2+ length  2

now here in the language smallest string is length 2 which is “01” or “10” so by concatenate them we cant get “0000”  and L itself does not contain “0000”.

option c the string “111101” is present in the language ,it has even length and odd no of zero . So it will be in L*.

Option D is also not in the L* as it can be generate by concate either 

  1. zero length string + 3 length string
  2. 1 length string + 2 length

Now L does not not contain “010” 

we cant have this as well.

so correct answer is B,C.

• selected by
Position:
Show:

Related questions

6 6 votes
1 answers 1 answer
1.5k
1.5k views
KOMURAVELLI PRASHANT asked Aug 15, 2017
1,470 views
Let L be a language. We define another language L′ as followL′={w∣w is binary equivalent of 2^x, where x∈L and consider x as a binary number}Which of the following is fal...
0 0 votes
1 answers 1 answer
95
95 views
lambodar_pal asked Aug 20
95 views
How to get the answer of "The complement of a non regular is regular or non regular " ??
1 1 vote
1 1 answer
131
131 views
Shubham Sharma 2 asked Apr 19
131 views
Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason RAssertion A: If $L$ is regular, then its compliment $L^{\prime}$ is ne...
1 1 vote
2 2 answers
570
570 views
Shubham Sharma 2 asked Sep 10, 2025
570 views
Consider the following DFA that generates set of strings over $\Sigma=\{a, b, c\}$Now identify that which of the followings is the best description of the language for th...