Match List I with List II:
| List I |
List II |
| (A) |
Type 0 |
(I) |
Finite automata |
| (B) |
Type 1 |
(II) |
Tuning machine |
| (C) |
Type 2 |
(III) |
Linear bound automata |
| (D) |
Type 3 |
(IV) |
Pushdown automata |
Choose the correct answer from the options given below:
1.(A) - (III), (B) - (IV), (C) - (II), (D) - (I)
2.(A) - (II), (B) - (III), (C) - (IV), (D) - (I) ✓ Correct
3.(A) - (III), (B) - (IV), (C) - (I), (D) - (II)
4.(A) - (II), (B) - (III), (C) - (II), (D) - (IV)
Solution
Concept:
Grammar:
It is a finite set of formal rules for generating syntactically correct sentences or meaningful correct sentences.
According to Noam Chomosky, there are four types of grammar.
They are Type0, Type1, Type2, Type3.
| Grammar Type |
Grammar Accepted |
Language Accepted |
Automata |
| Type 0 |
Unrestricted grammar |
Recursively enumerable language |
Turning Machine |
| Type 1 |
Context-sensitive grammar |
Context-sensitive language |
Linear-bounded automata |
| Type 2 |
Context-free grammar |
Context-free language |
Pushdown automata |
| Type 3 |
Regular grammar |
Regular language |
Finite state automata |

The Correct Answer is option 2.