in Theory of Computation
264 views
0 votes
0 votes
Unrestricted grammar generate Recursive enumerable language.

Am i right??
in Theory of Computation
by
264 views

1 Answer

0 votes
0 votes
Yeah you are right

3 Comments

yes, generate both recursive and recursive enumerable language
0
0
And context sensitive generates only recursive??
0
0
yeah you can say that as , CSG falls under the recursive so every CSG is recursive but not vice versa
0
0