type of language

Question

let L=(a,b,c)* | the length of x is square then L is -

a)Regular

b)recursive but not context free

c)context free but not regular

d)none of these.

Comments

it look like incomplete question

---

i think its B recursive but not CFL

---

Yes i think its option B recursive but not CFL

Answer 1

Yes It will be Recursive and can't be CFL  bcz if the length is in square i.e power is non-linear and whenever the length is non linear like factorial, underoot etc then it can't be CFL

Comments

L = (a+b+c)* , isn't it regular ?