Match of the language with its machine format. Language Machine I.…
2023
Match of the language with its machine format.
Language | Machine |
I. Unrestricted language | 1. Finite automata |
II. Context sensitive language | 2. Push down automata |
III. Context free language | 3. Linear bounded automata |
IV. Regular expression | 4. Turing machine |
- A.
I - 2; II - 3; III - 4; IV - 1
- B.
I - 4; II - 2; III - 1; IV - 3
- C.
I - 3; II - 4; III - 1; IV - 2
- D.
I - 4; II - 3; III - 2; IV - 1
Attempted by 55 students.
Show answer & explanation
Correct answer: D
By the Chomsky hierarchy, unrestricted languages are recognized by Turing machines, context-sensitive languages by linear bounded automata, context-free languages by pushdown automata, and regular expressions/regular languages by finite automata. Hence the correct matching is I - 4; II - 3; III - 2; IV - 1.