Match List I with List II.
Choose the correct answer from the options given below:
| List I | List II |
|---|---|
| A. Type 0 | I. Finite automata |
| B. Type 1 | II. Turing machine |
| C. Type 2 | III. Linear bounded automata |
| D. Type 3 | IV. Pushdown automata |
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. A-II, B-III, C-IV, D-I
Explanation
Chomsky hierarchy: Type 0 ↔ Turing machine, Type 1 ↔ linear bounded automaton, Type 2 ↔ pushdown automaton, Type 3 ↔ finite automaton.More Theory of Computation and Compilers questions
- Consider the following statements: Statement I: An LALR parser is more powerful than a canonical LR parser. Statement II: An SLR parser is…
- Consider the following statements about context-free languages (CFL): Statement I: CFLs are closed under homomorphism. Statement II: CFLs a…
- Match List – I with List – II. List – I (Propositions) (A) P ∧ (P → Q) (B) ¬(P ∨ Q) → (P ∧ Q) (C) P → Q (D) P ∨ (Q ∧ R) List – II (Disjunct…
- Overfitting is expected when we observe that?
- Mr X designed open source software which must comply with some criteria. Choose the false statement in respect of above. (A) No restriction…
- Match List (I) with List (II): List I A. Product Complexity B. Structured System Analysis C. Coupling & cohesion D. Symbolic Execution List…