MadeEasy

Question

Match List-l with List-|l and select the correct answer using the codes given below the lists:

List-I List-II

A. Regular grammar                               1. Pushdown automaton
 

B. Context free grammar                       2. Linear bounded automaton

C Unrestricted grammar                        3. Deterministic finite                                  .

D. Context sensitive grammar             4. Turing machine

Codes:

           A     B     C     D

(a)      3     1     2     4

(b)      3     1     4     2

Which of the options are correct and why?

Answer 1

Option b is correct

Comments

Can you explain?

---

Regular grammar produces regular language which is accepted by DFA.

Context free grammar produces CFL  which is accepted by push down automata ( Finite automata + Stack)

 Unrestricted grammar (Recursively ennumerable grammar) produces REL which is accepted by Turing machine

 Context sensitive grammar produces CSL which is accepted by linear bound automata ( FA+stack+stack)

Answer 2

B

Answer 3

Option B is correct.

Answer 4

Answer: Correct Option is (b)

A. Regular grammar  = 3. Deterministic finite       

B. Context free grammar =  1. Pushdown automaton

C Unrestricted grammar =   4. Turing machine

D. Context sensitive grammar = 2. Linear bounded automaton