# type of language

170 views
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.
1
it look like incomplete question
1
i think its B recursive but not CFL
0
Yes i think its option B recursive but not CFL

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
0
L = (a+b+c)* , isn't it regular ?

## Related questions

1
143 views
1 vote
Identify type of grammer:- S-> a | $\epsilon$ 1. TYPE 0 2. TYPE 1 3. TYPE 2 4. TYPE 3