The language L = { 0^i 2 1 ^i i>-0 } over the alphabet (0,1,2) is

Home / Engineering / Theory of Computation and Compiler Design / Question

M

Mr. Dubey • 51.47K Points
Coach

Q.) The language L = { 0^i 2 1 ^i i>-0 } over the alphabet (0,1,2) is

(A) not recurcise

(B) is recursive and deterministic CFL

(C) is a regular language

(D) is not a deterministic CFL but a CFL

Correct answer : Option (B) - is recursive and deterministic CFL

Share

Discusssion

Login to discuss.

Related MCQs on Theory of Computation and Compiler Design

Q. A variable on its own or in its complemented form is known as a

Q. Wireless networks are wired networks.

Q. The two facilities provided by the debugger is

Q. Let R and S be two relations on a set of positive integers I. If R = {(a, 3a+a)},S = {(a,a+a)} then R composition R composition R = __________.

Q. SIMD stands for

Q. Defects are less costly if detected in which of the following phases

Q. A binary semaphore is a semaphore with integer values

Q. The is the BUS used in Macintosh PC’s.

Q. The ________ algorithm is based on the observation that the frequent sets are normally very few in number compared to the set of all itemsets.

Q. In reliability models, our emphasis is on