Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET

Previous Year Question (PYQs)

Match List I with List II:
List IList II
(A) Type 0(I) Finite Automata
(B) Type 1(II) Turing Machine
(C) Type 2(III) Linear bound Automata
(D) Type 3(IV) Pushdown Automata
Choose the correct answer from the options given below:




Solution

This question is based on Chomsky hierarchy.

In Chomsky hierarchy:

Type $0$ grammar is unrestricted grammar.

It is accepted by Turing Machine.

So,

$(A)-(II)$

Type $1$ grammar is context sensitive grammar.

It is accepted by Linear Bounded Automata.

So,

$(B)-(III)$

Type $2$ grammar is context free grammar.

It is accepted by Pushdown Automata.

So,

$(C)-(IV)$

Type $3$ grammar is regular grammar.

It is accepted by Finite Automata.

So,

$(D)-(I)$

Final matching is:

$(A)-(II), (B)-(III), (C)-(IV), (D)-(I)$

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More
Ask Your Question or Put Your Review.

loading...