search
Log In
0 votes
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.
in Theory of Computation 170 views
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

1 Answer

0 votes
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 vote
1 answer
2
135 views
Identify type of grammer:- S-> a | $\epsilon$ 1. TYPE 0 2. TYPE 1 3. TYPE 2 4. TYPE 3
asked Sep 11, 2017 in Theory of Computation rahul sharma 5 135 views
0 votes
0 answers
3
110 views
Suppose We are given " set of productions " Then how can we identify the lamguage class ffrom them .? please explain giving examples to each language classes
asked Jan 9, 2017 in Theory of Computation Anjana Babu 110 views
0 votes
1 answer
4
87 views
Please suggest me in briefly for revision . How to we test regular,dcfl,cfl,recursive and recursive enumeranle. Eg say if we can find the pattern it's regular. Please help
asked Jan 24, 2019 in Theory of Computation Mayankprakash 87 views
...