Gatebook

Question

Let L={x | x ϵ (0+1)* ,If x_{i}(bit at i^th position of x)=1 then each of the next i positions must be a 1} then L is

(A). R.E but not Recursive

(B). CFL but not regular

(C). Recursive but not C.F.L

(D). Regular

Comments

Is the regular expression for above language : 0*(epsilon + 1(1)* )... anyone please verify ..

---

bit at position of x what is he meaning of that.

---

Question here is incomplete .. i commented here though i read this question on facebook .. it's : " Let L={x | x ϵ (0+1)* ,If x_{i}(bit at i^{th} position of x)=1 then each of the next i positions must be a 1} then L is "