4 4 votes Is a^nb^3^n is CsL or Recursive or Recursive enumerable? Please draw the state transition diagram also I think it is not any of them.because b^3^n I can't put in loop Theory of Computation + – sbose22 1.4k views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply Arnab Bhadra commented Sep 10, 2017 reply Follow flag I think its CSL that mean recursive language But I cannot able to draw the state diagram. we can determine the value of 3n by Linear bounded automata. and count the number of a's and b's in the string. 0 0 replyShare sbose22 commented Sep 14, 2017 reply Follow flag Wrong..for 3n cfl enough.we dont need LBA 0 0 replyShare Please log in or register to add a comment.
1 1 vote Is it 3n or 3^n? If it is 3n then it can be a CFL but if it is 3^n then according to me it should be a Recursive Language. Please correct me if I am wrong Manish Chetwani answered Sep 11, 2017 Manish Chetwani comment Share Follow See 1 comment 1 1 comment reply sbose22 commented Sep 14, 2017 reply Follow flag it is 3^n...if it would have 3n then i would not have posted it..if recursive can you draw TM? 0 0 replyShare Please log in or register to add a comment.
0 0 votes It is recursive and i think it's belong to TM as a comparator in which (a<b) condition will satisfy. 1gate_cracker answered Nov 10, 2017 1gate_cracker comment Share Follow 0 reply Please log in or register to add a comment.
