TOC Grand Test 1 Question 16

+1 vote
L = {B(N)#B(N+1) : B(N) represents binary pattern for given N. Example B(5)=101, N>=1}. Then which of the following is true for L?

(A). L is regular

(B). L is CFL but not regular

(C). L is Recursive but not CFL

(D). L is recursive enumerable but not recursive
asked Oct 22, 2016 in TOC by getgatebook (32,410 points)
edited Nov 4, 2016 by getgatebook

2 Answers

0 votes
Please explain
answered Nov 7, 2016 by kd (340 points)
0 votes
TM can act as a transducer which means it can take an input and can convert it into some other form.
answered Dec 1, 2016 by superask (230 points)