Vous êtes sur la page 1sur 4

If G is Context sensitive grammar, then L(g) is (a) (b) (c) (d) Always Recursive RE but not Recursive May

be recursive None

Which of the following statements is true for LBA (a) (b) (c) (d) It is guaranteed to halt on all inputs Halts only on those inputs that it accepts May or may not halt on an input not acceptable to it Never halts

If L can be generated in canonical order then L is: (a) (b) (c) (d) Recursive RE but not recursive Non-recursively enumerable None

The class of type (1) grammars corresponds to: (a) (b) (c) (d) LBA PDA FA TM

TM has: (a) (b) (c) (d) Finite and read only tape Infinite and read only tape Infinite and read-write tape Finite and read-write tape

Consider L={G,w | w is in L9G)}, where G is an arbitrary context free grammar and w is an arbitrary string. L is : (a) (b) (c) (d) Recursive RE not recursive Non-recursively Enumerable None

If G is Context sensitive grammar, then L(G) is : (a) Always recursive

(b) RE but Not Recursive (c) May be recursive (d) None Intersection of two recursive or Turing decidable language is : (a) (b) (c) (d) Always recursive Always Non-recursive May be recursive may not be recursive None

Given arbitrary TM M, the problem of deciding whether L(M)!= is (a)Decidable (b) Un Decidable The complement of Turing acceptable language is always (a) (b) (c) (d) Turing Acceptable LBA acceptable PDA acceptable FA acceptable

For a give TM M1, M2 the problem of deciding whether L(M1)=L(M2) is (a) (b) (c) (d) Decidable Un decidable Not any thing None

Given arbitrary TM M, the problem of deciding whether L(M) is recursive is (a) Decidable (b) Un Decidable If strings of L be effectively enumerated in lexicographic order then L is (a) (b) (c) (d) Recursive Non Recursive RE CSG

Consider L={a^ib^j | i!=J }, the complement of L is

(a) CFG (b) CSL

(c) RL (d) Recursive


If L is CSL, then membership problem of L is (a) (b) (c) (d) Decidable Not Decidable NP problem P problem

CSLs are closed under intersection (a) (b) (c) (d) (e) True False Decidable A and C Un Decidable

Every Turing decidable (i.e recursive ) language is Turing acceptable ( i.e RE) (a) True (b) False Every Turing acceptable (i.e RE) language is turing acceptable (i.e Recursive) (a) True (b) False The problem of determining whether for a given CFG G, L(G) is empty decidable (a) True (b) False A language is Turing acceptable IFF it is output of some (a)Turing machine (b)PDA (c)FA (d)LBA The complement of a Turing acceptable language is (a) Always Acceptable language (b) Decidable language

(c) Non acceptable (d) May be acceptable language For two given CFGs G1 and G2, the problem of deciding whether L(G1)=L(G2) is (a) Decidable (b) Un Decidable The problem of determining whether for a given CFG G, L(G) is empty is (a) Decidable (b) Un Decidable