0 0 votes Unrestricted grammar generate Recursive enumerable language. Am i right?? Theory of Computation + – saif 649 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes Yeah you are right rballiwal answered Dec 17, 2018 rballiwal comment Share Follow See all 3 Comments 3 3 Comments reply raushan sah commented Dec 17, 2018 reply Follow flag yes, generate both recursive and recursive enumerable language 0 0 replyShare saif commented Dec 17, 2018 reply Follow flag And context sensitive generates only recursive?? 0 0 replyShare rballiwal commented Dec 17, 2018 reply Follow flag yeah you can say that as , CSG falls under the recursive so every CSG is recursive but not vice versa 0 0 replyShare Please log in or register to add a comment.
