in Theory of Computation closed by
220 views
0 votes
0 votes
closed with the note: Duplicate of : https://gateoverflow.in/82347/gatebook
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
in Theory of Computation closed by
220 views
Answer:

Related questions